#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using ll = long long;

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int X, Y;
    cin >> X >> Y;
    vector P(2, vector<int>(2));
    auto f = [&](const vector<int>& v) -> int {
        int res = v[0];
        for (int i = 1; i < int(v.size()); i++) res = P[res][v[i]];
        return res;
    };
    for (int i = 3; i < 12; i++) {
        for (int S = 0; S < 1 << i; S++) {
            vector<int> v;
            for (int j = 0; j < i; j++) v.emplace_back(S >> j & 1);
            vector<int> val(2, -1);
            bool ok = true;
            for (int mask = 0; mask < 1 << 4; mask++) {
                P[0][0] = mask >> 0 & 1;
                P[0][1] = mask >> 1 & 1;
                P[1][0] = mask >> 2 & 1;
                P[1][1] = mask >> 3 & 1;
                int& cur = val[P[X][Y]];
                int nxt = f(v);
                if (cur != -1 and cur != nxt) {
                    ok = false;
                    break;
                } else {
                    cur = nxt;
                }
            }
            if (val[0] == val[1]) ok = false;
            if (ok) {
                cout << v.size() << endl;
                cout << v << endl;
                int res;
                cin >> res;
                for (int k = 0; k < 2; k++) {
                    if (val[k] == res) {
                        cout << k << endl;
                    }
                }
                return 0;
            }
        }
    }
    return 0;
}