#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll x, y;
    cin >> x >> y;
    ll ans = 12345634537849;
    if (x <= y)ans = min(ans, y - x);
    if (-x <= y)ans = min(ans, y + x +1);
    if (x <= -y)ans = min(ans, - y - x+1);
    if (-x <= -y)ans = min(ans, - y + x + 2);
    cout << ans << endl;
}
#include<stdio.h>
int main()
{
	printf("100 100\n");
    int m,n;
    scanf("%d%d",&m,&n);
    /*
    .*.*.*
    ******
    *.*.*.
    ......
    */
    /*for(int i=0;i<50;i++)
    {
        for(int j=0;j<100;j++)
        {
            if(m<n&&(m-n)%2==0)
            {
                m--;
                printf(".");
            }
            else printf("#");
        }
        printf("\n");
    }*/
    for(int i=0;i<50;i++)
    {
        for(int j=0;j<100;j++)
        {
            if(m!=1&&i%2==0&&j%2==0)
            {
                m--;
                printf(".");
            }
            else printf("#");
        }
        printf("\n");
    }
	/*
    for(int i=50;i<100;i++)
    {
        for(int j=0;j<100;j++)
        {
            if(m>n&&(m-n)%2==0)
            {
                n--;
                printf("#");
            }
            else printf(".");
        }
        printf("\n");
    }*/
    for(int i=50;i<100;i++)
    {
        for(int j=0;j<100;j++)
        {
            if(n!=1&&i%2!=0&&j%2!=0)
            {
            	printf("#");
                n--;
            }
            else printf(".");
        }
        printf("\n");
    }
}