#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-10;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
inline void init() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) {
  int temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
void endRight(int m) {
  for (int i = 0; i < m - 1; i++) {
    cout << '.';
  }
  cout << '#' << endl;
}
void endLeft(int m) {
  cout << '#';
  for (int i = 1; i < m; i++) {
    cout << '.';
  }
  cout << endl;
}
void full(int m) {
  for (int i = 0; i < m; i++) {
    cout << '#';
  }
  cout << endl;
}
int main() {
  init();
  int n, m;
  scanf("%d%d", &n, &m);
  full(m);
  bool isRight = true;
  for (int i = 1; i < n; i++) {
    if (i % 2 != 0) {
      if (isRight) {
        endRight(m);
      } else {
        endLeft(m);
      }
      isRight = !isRight;
    } else {
      full(m);
    }
  }
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-10;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
inline void init() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) {
  int temp = gcd(a, b);
  return temp ? (a / temp * b) : 0;
}
void endRight(int m) {
  for (int i = 0; i < m - 1; i++) {
    cout << '.';
  }
  cout << '#' << endl;
}
void endLeft(int m) {
  cout << '#';
  for (int i = 1; i < m; i++) {
    cout << '.';
  }
  cout << endl;
}
void full(int m) {
  for (int i = 0; i < m; i++) {
    cout << '#';
  }
  cout << endl;
}
int main() {
  init();
  int n, m;
  scanf("%d%d", &n, &m);
  full(m);
  bool isRight = true;
  for (int i = 1; i < n; i++) {
    if (i % 2 != 0) {
      if (isRight) {
        endRight(m);
      } else {
        endLeft(m);
      }
      isRight = !isRight;
    } else {
      full(m);
    }
  }
  return 0;
}

```