#include <bits/stdc++.h>
using namespace std;
bool isEven(long long n) { return n % 2 == 0 ? true : false; }
bool isPalindrome(long long a[], long long n) {
  long long l = 0;
  long long h = n - 1;
  while (h > l) {
    if (a[l++] != a[h--]) {
      return false;
    }
  }
  return true;
}
long long sumOfDigits(long long n) {
  long long sum = 0;
  while (n) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j < m; j++) {
      if (i % 2 == 1)
        cout << "#";
      else if (i % 4 == 0) {
        if (j == 0)
          cout << "#";
        else
          cout << ".";
      } else {
        if (j == m - 1)
          cout << "#";
        else
          cout << ".";
      }
    }
    cout << endl;
  }
}

### Prompt

Your challenge is to write 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;
bool isEven(long long n) { return n % 2 == 0 ? true : false; }
bool isPalindrome(long long a[], long long n) {
  long long l = 0;
  long long h = n - 1;
  while (h > l) {
    if (a[l++] != a[h--]) {
      return false;
    }
  }
  return true;
}
long long sumOfDigits(long long n) {
  long long sum = 0;
  while (n) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 0; j < m; j++) {
      if (i % 2 == 1)
        cout << "#";
      else if (i % 4 == 0) {
        if (j == 0)
          cout << "#";
        else
          cout << ".";
      } else {
        if (j == m - 1)
          cout << "#";
        else
          cout << ".";
      }
    }
    cout << endl;
  }
}

```