#include <bits/stdc++.h>
using namespace std;
long long BigMod(long long B, long long P, long long M) {
  long long R = 1;
  while (P > 0) {
    if (P % 2 == 1) {
      R = (R * B) % M;
    }
    P /= 2;
    B = (B * B) % M;
  }
  return R % M;
}
int main() {
  int n, m;
  cin >> n >> m;
  bool last = 1;
  for (int i = 1; i <= n; i++) {
    if (i % 2 == 1) {
      for (int j = 1; j <= m; j++) cout << "#";
      cout << endl;
    } else {
      if (last == 0) {
        cout << "#";
      }
      for (int j = 1; j < m; j++) cout << ".";
      if (last == 1) {
        cout << "#";
      }
      cout << endl;
      if (last == 0)
        last = 1;
      else
        last = 0;
    }
  }
  return 0;
}
