Internet Problem Solving Contest

• Easy input data set – G1
• Hard input data set – G2

Ever since Jan learned his numbers, he loved to make number riddles. Already as a small boy, he annoyed everyone with them. Right now, he made up a new guessing game and came to annoy you. You have to guess the numbers that Jan thinks.

Problem specification

Jan thinks of a sequence of N non-negative integers. Each of these integers has at most D digits. Your task is to guess the entire sequence using as few submits as possible. You can make two types of submits:

1. Question. You submit a sequence of N non-negative integers. Each of these integers can have at most G digits. As the evaluation result you will receive the scalar product of Jan's sequence and the sequence you submitted. (See below for a clarification if you don't know what a scalar product is.)
2. Guess. You submit a sequence of N non-negative integers. Each of these integers can have at most D digits. As the evaluation result you will be notified whether you guessed the entire sequence correctly.

The scalar product of two sequences (X₁, ..., X_N) and (Y₁, ..., Y_N) can be calculated as follows:

(X₁, ..., X_N) · (Y₁, ..., Y_N) = X₁.Y₁ + ... + X_N.Y_N

This means that Jan takes his first number and multiplies it by your first number, then he takes his second thought number and multiplies it by your second number and so on. In this way he will get N numbers. The scalar product of the two sequences is the sum of these N numbers.

Input specification

The input file contains three positive integers: N, D and G separated by a single space. N is the length of the sequence that Jan is thinking of. D is the maximal number of digits of each of Jan's numbers. G is the maximal number of digits in the numbers you may use in your questions.

Output specification

The output file you will be submitting must contain exactly N+1 rows. The first row must contain a zero (0) if the submit is a question, or a one (1) if the submit is a guess. The next N rows must contain the sequence you want to submit. More precisely, each of the next N rows must contain one non-negative integer. The integer must not contain unnecessary leading zeroes. If the submit is a question, each of the integers must contain at most G digits. If it is a guess, each of the integers must contain at most D digits.

Evaluation result

For a malformed submit the evaluation result will be an appropriate error message.

For a question the answer will be one non-negative integer – the scalar product of Jan's sequence and the sequence you submitted. Note that the answer will always be exact and that it may contain more than G digits.

For an incorrect guess the evaluation result will be Wrong answer. For a correct guess the evaluation result will be OK, and you will receive points for solving the corresponding input.

Note that for each input you may only make ten (10) submits, i.e., at most 9 questions and a guess.

Example

Input:

3 4 5

Submits:

You: 0 7 3 5
Jan: 28
You: 0 6 4 1
Jan: 17
You: 0 0 2 2
Jan: 10
You: 1 1 2 3
Jan: OK

Note that for readability each of your submits was formatted to fit on a single line.

---

Credits:
Problemsetter(s): misof (adapted from folklore)
Contest-related materials: Monika, misof, Mino