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

#########
........#
#########
#........
#########
........#
#########
#........
#########
#include <bits/stdc++.h>
using namespace std;
ifstream fin("input.txt");
ofstream fout("output.txt");
bool isPrime(int x) {
  if (x <= 4 || x % 2 == 0 || x % 3 == 0) return x == 2 || x == 3;
  for (int i = 5; i * i <= x; i += 6)
    if (x % i == 0 || x % (i + 2) == 0) return 0;
  return 1;
}
inline void boostIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  int n;
  cin >> n;
  int m;
  cin >> m;
  bool IsBegin = 0;
  bool FullLine = 1;
  for (long long int i = 0; i < (n); ++i) {
    if (FullLine == 1) {
      for (long long int j = 0; j < (m); ++j) cout << "#";
    } else {
      if (IsBegin == 0) {
        for (long long int j = 0; j < (m - 1); ++j) cout << ".";
        cout << "#";
      }
      if (IsBegin == 1) {
        cout << "#";
        for (long long int j = 0; j < (m - 1); ++j) cout << ".";
      }
      IsBegin = 1 - IsBegin;
    }
    FullLine = 1 - FullLine;
    cout << endl;
  }
  return 0;
}
