codeforces——510A——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 ofr-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 andm (3 ≤ n, m ≤ 50).

n is an odd number.

Output

Output n lines. Each line should contain a string consisting ofm characters. Do not output spaces.

Examples

Input

3 3

Output

###..####

Input

3 4

Output

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

Input

5 3

Output

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

Input

9 9

Output

#########........###########........#########........###########........#########题意不多说，看输出很容易理解水题 
#include<stdio.h>#include<iostream>#include<algorithm>#include<cmath>#include<cstring>using namespace std;int func1(int a,int b);int main(){    int n,m;;    while(~scanf("%d%d",&n,&m))    {        char a[50][50];        for(int i=0; i<n; i++)            if(i%2==1)            {                memset(a[i],'.',sizeof(a[i]));                if((i-1)%4==0)                    a[i][m-1]='#';                else                    a[i][0]='#';            }            else                memset(a[i],'#',sizeof(a[i]));        for(int i=0; i<n; i++)        {            for(int j=0; j<m; j++)                cout<<a[i][j];            cout<<endl;        }    }    return 0;}