/+ dub.sdl:
    name "B"
    dependency "dcomp" version=">=0.6.0"
+/
 
import std.stdio, std.range, std.algorithm, std.conv, std.random;
// import dcomp.scanner;
 
Scanner sc;
static this() {
    sc = new Scanner(stdin);
}
int n;
int[] mp;
bool query(int a, int b) {
    writefln("? %d %d", mp[a], mp[b]);
    stdout.flush;
    string s;
    sc.read(s);
    return s == "Y";
}
 
int main() {
    int a, b;
    sc.read(a, b);
    n = a+b;
    mp = iota(n).array;
//    mp.randomShuffle;
    if (a <= b) {
        writeln("Impossible");
        return 0;
    }
 
    bool[] res = new bool[n];
    foreach (i; 0..n) {
        res[i] = query(i, (i+1)%n);
    }
//    writeln(res);
 
    int ma = 0, tr = -1;
    foreach (i; 0..n) {
        //o, x
        if (res[i] || !res[(i+n-1)%n]) continue;
        int co = 0;
        int j = (i+n-1)%n;
        while (res[j]) {
            co++;
            j = (j+n-1)%n;
        }
        if (ma < co) {
            ma = co;
            tr = i;
        }
    }
    auto u = iota(n).map!(x => query(tr, x) ? 1 : 0);
    bool[] ans = new bool[n];
    iota(n).each!(x => ans[mp[x]] = query(tr, x));
    writeln("! ", ans.map!(x => (x) ? "1" : "0").join(""));
    return 0;
}
/* IMPORT /home/yosupo/Program/dcomp/source/dcomp/scanner.d */
// module dcomp.scanner;
 
class Scanner {
    import std.stdio : File;
    import std.conv : to;
    import std.range : front, popFront, array, ElementType;
    import std.array : split;
    import std.traits : isSomeChar, isStaticArray, isArray; 
    import std.algorithm : map;
    File f;
    this(File f) {
        this.f = f;
    }
    string[] buf;
    private bool succ() {
        while (!buf.length) {
            if (f.eof) return false;
            buf = f.readln.split;
        }
        return true;
    }
    private bool readSingle(T)(ref T x) {
        if (!succ()) return false;
        static if (isArray!T) {
            alias E = ElementType!T;
            static if (isSomeChar!E) {
                //string or char[10] etc
                x = buf.front;
                buf.popFront;
            } else {
                static if (isStaticArray!T) {
                    //static
                    assert(buf.length == T.length);
                }
                x = buf.map!(to!E).array;
                buf.length = 0;                
            }
        } else {
            x = buf.front.to!T;
            buf.popFront;            
        }
        return true;
    }
    int read(T, Args...)(ref T x, auto ref Args args) {
        if (!readSingle(x)) return 0;
        static if (args.length == 0) {
            return 1;
        } else {
            return 1 + read(args);
        }
    }
}
 
unittest {
    import std.path : buildPath;
    import std.file : tempDir;
    import std.algorithm : equal;
    import std.stdio : File;
    string fileName = buildPath(tempDir, "kyuridenanmaida.txt");
    auto fout = File(fileName, "w");
    fout.writeln("1 2 3");
    fout.writeln("ab cde");
    fout.writeln("1.0 1.0 2.0");
    fout.close;
    Scanner sc = new Scanner(File(fileName, "r"));
    int a;
    int[2] b;
    char[2] c;
    string d;
    double e;
    double[] f;
    sc.read(a, b, c, d, e, f);
    assert(a == 1);
    assert(equal(b[], [2, 3]));
    assert(equal(c[], "ab"));
    assert(equal(d, "cde"));
    assert(e == 1.0);
    assert(equal(f, [1.0, 2.0]));
}


Measured memory_bytes: 1100