#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int x, long long int y) {
  if (y > x) {
    return gcd(y, x);
  }
  if (y == 0) {
    return x;
  }
  return gcd(y, x % y);
}
bool prime(long long int x) {
  for (long long int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long int fact(long long int n) {
  if (n == 0) {
    return 1;
  }
  return n * fact(n - 1);
}
void solve() {
  long long int r, c;
  cin >> r >> c;
  long long int b = 1;
  for (long long int i = 0; i < r; i++) {
    if (i % 2 == 0) {
      for (long long int j = 0; j < c; j++) cout << '#';
      cout << endl;
    } else {
      if (b == 1) {
        for (long long int j = 0; j < c - 1; j++) cout << '.';
        cout << '#';
        cout << endl;
        b = 0;
      } else {
        cout << '#';
        for (long long int j = 0; j < c - 1; j++) cout << '.';
        cout << endl;
        b = 1;
      }
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  long long int t = 1;
  while (t--) solve();
  return 0;
}

### Prompt

In cpp, your task is to solve 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 int gcd(long long int x, long long int y) {
  if (y > x) {
    return gcd(y, x);
  }
  if (y == 0) {
    return x;
  }
  return gcd(y, x % y);
}
bool prime(long long int x) {
  for (long long int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) {
      return 0;
    }
  }
  return 1;
}
long long int fact(long long int n) {
  if (n == 0) {
    return 1;
  }
  return n * fact(n - 1);
}
void solve() {
  long long int r, c;
  cin >> r >> c;
  long long int b = 1;
  for (long long int i = 0; i < r; i++) {
    if (i % 2 == 0) {
      for (long long int j = 0; j < c; j++) cout << '#';
      cout << endl;
    } else {
      if (b == 1) {
        for (long long int j = 0; j < c - 1; j++) cout << '.';
        cout << '#';
        cout << endl;
        b = 0;
      } else {
        cout << '#';
        for (long long int j = 0; j < c - 1; j++) cout << '.';
        cout << endl;
        b = 1;
      }
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  long long int t = 1;
  while (t--) solve();
  return 0;
}

```