import java.util.*;
import java.io.*;
import static java.lang.System.out;

/**
 *
 * ESAb ATAd
 *
 *
 */
public class Solution {

    private static Scanner sc;

    public static void main(String[] args) throws Exception {

        sc = new Scanner(System.in);

        String[] tb = sc.nextLine().split(" ");
        int T = Integer.parseInt(tb[0]);
        int B = Integer.parseInt(tb[1]);
        System.err.println(T + " " + B);

        for (int t = 1; t <= T; ++t) {
            solve(t, B);
        }

        sc.close();

        // tests();
    }

    private static void solve(int t, int B) {

        List<int[]> list = new ArrayList<int[]>();
        int[] tmp1 = new int[B];
        Arrays.fill(tmp1, -1);
        list.add(tmp1);

        for (int i = 0; i <= 150;) {
            for (int b = 0; b < B && i <= 150; ++b) {
                if (list.size() == 1) {
                    boolean isComplete = true;
                    int[] l = list.get(0);
                    for (int j = 0; j < B; j++) {
                        if (l[j] == -1) {
                            isComplete = false;
                            break;
                        }
                    }
                    if (isComplete) {
                        StringBuilder answer = new StringBuilder();
                        for (int j = 0; j < B; j++) {
                            answer.append(l[j]);
                        }
                        out.println(answer.toString());
                        String reply = sc.nextLine();
                        System.err.println("Reply: " + reply);
                        if ("Y".equals(reply)) return;
                        else System.exit(-1);
                    }
                }

                ++i; out.println(b+1);
                int bit = Integer.parseInt(sc.nextLine());
                System.err.println(bit);
                final int idx = b;
                if (i % 10 != 1) {
                    list.removeIf(l -> l[idx] != -1 && l[idx] != bit);
                }

                int size = list.size();
                for (int j = 0; j < size; j++) {
                    int[] l = list.get(j);

                    l[b] = bit;

                    if (i > 1 && i % 10 == 1) {
                        int[] inverted = invert(l, b);
                        list.add(inverted);
                        int[] tmp = reverse(l);
                        list.add(tmp);
                        tmp = reverse(inverted);
                        list.add(tmp);
                    }
                }
            }
        }
    }

    private static int[] invert(int[] array, int b) {
        int[] inverted = new int[array.length];

        for (int i = 0; i < inverted.length; i++) {
            if (i == b) {
                inverted[i] = array[i];
            } else if (array[i] == -1) {
                inverted[i] = -1;
            } else {
                inverted[i] = array[i] == 0 ? 1 : 0;
            }
        }

        return inverted;
    }

    private static int[] reverse(int[] array) {
        int[] reversed = new int[array.length];

        for (int i = 0, j = array.length - 1; i < array.length/2; i++, j--) {
            reversed[i] = array[j];
            reversed[j] = array[i];
        }

        return reversed;
    }
}