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 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<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int n,m,i,j;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		for(i=1;i<=n;i++)
		{
			if(i%2)
			{
				for(j=1;j<=m;j++)
				printf("#");
				printf("\n");
			}
			else if(i%4==0)
			{
				printf("#");
				for(j=2;j<=m;j++)
				printf(".");
				printf("\n");
			}
			else
			{
				for(j=1;j<m;j++)
				printf(".");
				printf("#\n");
			}
		}
	}
	return 0;
 }