#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1ll;
  while (b > 0) {
    if (b % 2ll) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b /= 2ll;
  }
  return res;
}
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i++) {
    res = (res * i) % 1000000007;
  }
  return res % 1000000007;
}
bool comp(pair<string, long long> a, pair<string, long long> b) {
  if (a.second != b.second) return a.second > b.second;
  return a.first < b.first;
}
void solve() {
  long long x, y;
  cin >> x >> y;
  for (long long i = 1; i <= x; i++) {
    for (long long j = 1; j <= y; j++) {
      if (i % 4 == 1 || i % 4 == 3) {
        cout << '#';
      } else if (i % 4 == 2) {
        if (j == y) {
          cout << '#';
        } else {
          cout << '.';
        }
      } else if (i % 4 == 0) {
        if (j == 1) {
          cout << '#';
        } else {
          cout << '.';
        }
      }
    }
    cout << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1;
  while (tc--) {
    solve();
  }
}

### Prompt

Generate a Cpp solution to the following problem:

Fox Ciel starts to learn programming. The first task is drawing a fox! However, that turns out to be too hard for a beginner, so she decides to draw a snake instead.

A snake is a pattern on a n by m table. Denote c-th cell of r-th row as (r, c). The tail of the snake is located at (1, 1), then it's body extends to (1, m), then goes down 2 rows to (3, m), then goes left to (3, 1) and so on.

Your task is to draw this snake for Fox Ciel: the empty cells should be represented as dot characters ('.') and the snake cells should be filled with number signs ('#').

Consider sample tests in order to understand the snake pattern.

Input

The only line contains two integers: n and m (3 ≤ n, m ≤ 50). 

n is an odd number.

Output

Output n lines. Each line should contain a string consisting of m characters. Do not output spaces.

Examples

Input

3 3


Output

###
..#
###


Input

3 4


Output

####
...#
####


Input

5 3


Output

###
..#
###
#..
###


Input

9 9


Output

#########
........#
#########
#........
#########
........#
#########
#........
#########

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1ll;
  while (b > 0) {
    if (b % 2ll) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b /= 2ll;
  }
  return res;
}
long long GCD(long long a, long long b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i++) {
    res = (res * i) % 1000000007;
  }
  return res % 1000000007;
}
bool comp(pair<string, long long> a, pair<string, long long> b) {
  if (a.second != b.second) return a.second > b.second;
  return a.first < b.first;
}
void solve() {
  long long x, y;
  cin >> x >> y;
  for (long long i = 1; i <= x; i++) {
    for (long long j = 1; j <= y; j++) {
      if (i % 4 == 1 || i % 4 == 3) {
        cout << '#';
      } else if (i % 4 == 2) {
        if (j == y) {
          cout << '#';
        } else {
          cout << '.';
        }
      } else if (i % 4 == 0) {
        if (j == 1) {
          cout << '#';
        } else {
          cout << '.';
        }
      }
    }
    cout << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1;
  while (tc--) {
    solve();
  }
}

```