#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define all(a) begin(a), end(a)
template<class T> bool chmin(T& a, T b) { if(a <= b) return 0; a = b; return 1; }
template<class T> bool chmax(T& a, T b) { if(a >= b) return 0; a = b; return 1; }
ll dx[] = {0, 1, 0, -1};
ll dy[] = {1, 0, -1, 0};

#define EQ(a,b,op,c,d) ((a)*(d)op(c)*(b))
int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll p, q;
    cin >> p >> q;
    auto answer = [&](vector<string> S) {
        const ll H = S.size(), W = S[0].size();
        assert(H <= 1000);
        assert(W <= 1000);
        ll cnt = 0;
        for(auto& s : S) cnt += ranges::count(s, '#');
        assert(EQ(p,q,==,cnt,H*W));
        rep(i, 0, H) rep(j, 0, W) if(S[i][j] == '#') {
            ll cnt = 0;
            rep(d, 0, 4) {
                const ll x = (i + H + dx[d]) % H;
                const ll y = (j + W + dy[d]) % W;
                cnt += S[x][y] == '#';
            }
            assert(cnt == 3);
        }
        cout << H << ' ' << W << endl;
        for(auto& s : S) cout << s << '\n';
        exit(0);
    };
    if(p == 0) answer({"."});
    if(EQ(p,q,<=,2,3)) {
        ll a = 1, b = 2;
        while(EQ(p,q,<,2,b+2)){
            a++; b++;
        }
        for(ll xy=1; ; xy++) rep(x, 0, xy + 1) {
            const ll y = xy - x;
            if(EQ(2*(x+y),(a+2)*x+(b+2)*y,==,p,q)){
                string ans;
                rep(_, 0, x) ans += '#' + string(a, '.') + '#';
                rep(_, 0, y) ans += '#' + string(b, '.') + '#';
                answer({ans});
            }
        }
    }
    if(EQ(q-p,q,<,1,5)) {
        puts("-1 -1");
        return 0;
    }
    ll a = 1, b = 2;
    while(EQ(q-p,q,>,b,3*b+2)){
        a++; b++;
    }
    for(ll xy=1; ; xy++) rep(x, 0, xy + 1) {
        const ll y = xy - x;
        if(EQ(a*x+b*y,(3*a+2)*x+(3*b+2)*y,==,(q-p),q)){
            const ll h1 = (a+1) * x + (b+1) * y, w1 = x+y;
            const ll h2 = 1, w2 = 3;
            const ll W = w1 * w2, H = abs(h1 * (W / w1) - h2 * (W / w2));
            vector ans(H, string(H, '#'));
            vector<tuple<ll, ll, ll>> piece;
            {
                ll X = 0, Y = 0;
                rep(_, 0, H) {
                    rep(_, 0, x) {
                        piece.emplace_back(X, Y, a);
                        X += a + 1;
                        Y += 1;
                    }
                    rep(_, 0, y) {
                        piece.emplace_back(X, Y, b);
                        X += b + 1;
                        Y += 1;
                    }
                }
            }
            ll X = 0, Y = 0;
            auto at = [&](ll i, ll j) -> char& {
                return ans[i % H][j % H];
            };
            do {
                for(auto [dx, dy, a] : piece) {
                    rep(i, 0, a) at(X + dx + i, Y + dy) = '.';
                }
                X += 1;
                Y += 3;
            } while(Y % H);
            answer(ans);
        }
    }
}