#include <bits/stdc++.h>
using namespace std;
long long mod = (long long)1e9 + 7;
const long long INF = (long long)1e18;
long long power(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= mod) ret %= mod;
    if (a >= mod) a %= mod;
    b >>= 1;
  }
  return ret;
}
long long inv(long long x) { return power(x, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  long long n, m, flag = 0;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) {
    if (i % 2 == 0) {
      for (long long j = 0; j < m; j++) cout << "#";
    } else {
      if (flag == 0) {
        flag++;
        for (long long i = 0; i < m - 1; i++) cout << ".";
        cout << "#";
      } else {
        flag = 0;
        cout << "#";
        for (long long i = 0; i < m - 1; i++) cout << ".";
      }
    }
    cout << "\n";
  }
}

### Prompt

Your task is to create 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 mod = (long long)1e9 + 7;
const long long INF = (long long)1e18;
long long power(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= mod) ret %= mod;
    if (a >= mod) a %= mod;
    b >>= 1;
  }
  return ret;
}
long long inv(long long x) { return power(x, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  long long n, m, flag = 0;
  cin >> n >> m;
  for (long long i = 0; i < n; i++) {
    if (i % 2 == 0) {
      for (long long j = 0; j < m; j++) cout << "#";
    } else {
      if (flag == 0) {
        flag++;
        for (long long i = 0; i < m - 1; i++) cout << ".";
        cout << "#";
      } else {
        flag = 0;
        cout << "#";
        for (long long i = 0; i < m - 1; i++) cout << ".";
      }
    }
    cout << "\n";
  }
}

```