#include <bits/stdc++.h>
const int MAXN = (int)1e2 + 5;
const int MODN = (int)1e9 + 7;
int inf = 0x3f3f3f3f;
using namespace std;
char maps[MAXN][MAXN];
int main() {
  int n, m;
  while (scanf("%d%d", &n, &m) != EOF) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        maps[i][j] = '.';
      }
    }
    int y, x;
    int op = 1;
    int cango = 0;
    y = x = 0;
    while (1) {
      maps[y][x] = '#';
      if (op == 1) {
        x++;
        if (x == m - 1) {
          cango = 2;
          op = 2;
        }
      } else if (op == 2) {
        y++;
        cango--;
        if (y == n) break;
        if (cango == 0) {
          if (x == 0)
            op = 1;
          else
            op = 3;
        }
      } else if (op == 3) {
        x--;
        if (x == 0) {
          op = 2;
          cango = 2;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        printf("%c", maps[i][j]);
      }
      printf("\n");
    }
  }
}

### Prompt

Construct a cpp code solution to the problem outlined:

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>
const int MAXN = (int)1e2 + 5;
const int MODN = (int)1e9 + 7;
int inf = 0x3f3f3f3f;
using namespace std;
char maps[MAXN][MAXN];
int main() {
  int n, m;
  while (scanf("%d%d", &n, &m) != EOF) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        maps[i][j] = '.';
      }
    }
    int y, x;
    int op = 1;
    int cango = 0;
    y = x = 0;
    while (1) {
      maps[y][x] = '#';
      if (op == 1) {
        x++;
        if (x == m - 1) {
          cango = 2;
          op = 2;
        }
      } else if (op == 2) {
        y++;
        cango--;
        if (y == n) break;
        if (cango == 0) {
          if (x == 0)
            op = 1;
          else
            op = 3;
        }
      } else if (op == 3) {
        x--;
        if (x == 0) {
          op = 2;
          cango = 2;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        printf("%c", maps[i][j]);
      }
      printf("\n");
    }
  }
}

```