#include <bits/stdc++.h>

using namespace std;


using ll = long long;

#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) for(int i = 0; i < n; i += 1)
#define len(a) ((int)(a).size())


const ll inf = 1e18;
mt19937 rnd(234);


vector<string> anses[11][11];
const int maxn = 6;
const int maxm = 18;
int cur[maxn][maxm];


int get(int i, int j, int n, int m) {
    if (i < 0) i += n;
    if (j < 0) j += m;
    if (i >= n) i -= n;
    if (j >= m) j -= m;
    return cur[i][j];
}


bool check(int i, int j, int n, int m) {
    if (!get(i, j, n, m)) return true;
    return get(i - 1, j, n, m) + get(i + 1, j, n, m) + get(i, j - 1, n, m) + get(i, j + 1, n, m) == 3;
}


void rec(int i, int j, int n, int cnt) {
    if (i == 0 and j > 0) {
        int m = j;
        bool ok = true;
        rep(k, n)
            if (!check(k, m - 1, n, m) or !check(k, 0, n, m)) {
                ok = false;
                break;
            }
        if (ok) {
            int p = cnt;
            int q = n * m;
            int g = gcd(p, q);
            p /= g;
            q /= g;
            if (p <= 10 and q <= 10 and anses[p][q].empty()) {
                anses[p][q] = {};
                rep(i, n) {
                    string s;
                    s.resize(m);
                    rep(j, m) s[j] = (cur[i][j] ? '#' : '.');
                    anses[p][q].push_back(s);
                }
            }
        }
    }
    if (j == maxm) {
        return;
    }
    rep(val, 2) {
        cur[i][j] = val;
        if (j > 1 and !check(i, j - 1, n, maxm)) continue;
        int ni = i + 1;
        int nj = j;
        if (ni == n) {
            ni = 0;
            nj += 1;
        }
        rec(ni, nj, n, cnt + val);
    }
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    rep(p, 11) rep(q, 11) anses[p][q] = vector<string>();
    for (int n = 1; n <= maxn; n += 1) {
        rec(0, 0, n, 0);
    }
    int p, q;
    cin >> p >> q;
    if (anses[p][q].empty()) {
        if (3 * p <= 2 * q) {
            int b = 2 * p;
            int w = 2 * (q - p);
            vector<int> buckets(b / 2);
            int i = 0;
            rep(cnt, w) {
                buckets[i] += 1;
                i = (i + 1) % (b / 2);
            }
            cout << 1 << " " << b + w << "\n";
            rep(i, b / 2) {
                cout << "##";
                assert(buckets[i] > 0);
                rep(k, buckets[i]) cout << ".";
            }
            cout << "\n";
            return 0;
        }
        cout << -1 << " " << -1 << "\n";
        return 0;
    }
    int n = len(anses[p][q]);
    int m = len(anses[p][q][0]);
    cout << n << " " << m << "\n";
    rep(i, n) {
        cout << anses[p][q][i] << "\n";
    }
    return 0;
}