import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  debug {
    foreach (x; 0 .. 2) foreach (y; 0 .. 2) {
      for (int n = 3; ; ++n) {
        foreach (ask; 0 .. 1 << n) {
          bool ok = true;
          foreach (sec; 0 .. 16) {
            int op(int a, int b) {
              return sec >> (a*2+b) & 1;
            }
            int z = ask >> 0 & 1;
            foreach (i; 1 .. n) {
              z = op(z, ask >> i & 1);
            }
            ok = ok && (op(x, y) == z);
          }
          if (ok) {
            writeln([x, y], ": ", ask, " ", iota(n).map!(i => "01"[ask >> i & 1]));
            goto found;
          }
        }
      }
     found:
    }
  }
  
  const X = readInt;
  const Y = readInt;
  writeln(4);
  writeln(X, " ", Y, " ", Y, " ", Y);
  stdout.flush;
  const res = readInt;
  writeln(res);
  stdout.flush;
}