A. Fox And Snake

A. Fox And Snake

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

input

3 3

output

###
..#
###

input

3 4

output

####
...#
####

input

5 3

output

###
..#
###
#..
###

input

9 9

output

#########
........#
#########
#........
#########
........#
#########
#........
#########

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define maxn 55
#define inf 0x3f3f3f3f
typedef long long ll;
int n,m;
char mp[maxn][maxn];
int main()
{
    //freopen("in.txt","r",stdin);
    while(~scanf("%d%d",&n,&m)){
      memset(mp,'.',sizeof mp);
      int i=0,j=0;
      while(i<n){
        if(i%2==0){
            for(j=0;j<m;j++)
                mp[i][j]='#';
        }
        else {
            //if(lr%2==0)mp[i][0]=='#';
            //else mp[i][m-1]='#';
            //lr++;
            if(i%4==1)mp[i][m-1]='#';
            else if(i%4==3)mp[i][0]='#';
        }
        i++;
      }
      for(int i=0;i<n;i++){
        for(int j=0;j<m;j++)
        printf("%c",mp[i][j]);
        printf("\n");
      }
    }
}