Problem:
Score : 200 points

Problem Statement

You are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.

A pixel is the smallest element of an image, and in this problem it is a square of size 1×1.

Also, the given images are binary images, and the color of each pixel is either white or black.

In the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.

The image A is given as N strings A_1,...,A_N.

The j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).

Similarly, the template image B is given as M strings B_1,...,B_M.

The j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).

Determine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.

Constraints

1≦M≦N≦50

A_i is a string of length N consisting of # and ..

B_i is a string of length M consisting of # and ..

Input

The input is given from Standard Input in the following format:

N M
A_1
A_2
:
A_N
B_1
B_2
:
B_M

Output

Print Yes if the template image B is contained in the image A. Print No otherwise.

Sample Input 1

3 2
#.#
.#.
#.#
#.
.#

Sample Output 1

Yes

The template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.

Sample Input 2

4 1
....
....
....
....
#

Sample Output 2

No

The template image B, composed of a black pixel, is not contained in the image A composed of white pixels.

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>

int gaso(char *M, char *N, int Msu);

int main(void){
	int i,i2,Msu=0,Nsu=0,X=0,Y=0,hit=0,result=0,correct=0;
	char m[50][50],n[50][50], t[50];
	char *mp[50],*np[50];
	
	for(i=0 ; i < 50 ; i++){
		mp[i] = m[i];
		np[i] = n[i];
	}
	
	scanf("%d %d", &Nsu, &Msu);
	
	for(i=0 ; i < Nsu ; i++){
		scanf("%s", n[i]);
	}
	
	for(i=0 ; i < Msu ; i++){
		scanf("%s", m[i]);
	}

	for(i=0 ; i < Msu ; i++){
		result = gaso(mp[i], np[i], Msu);
		if(result == 1){
			correct++;
		};
	}
	
	if(correct == Msu){
		printf("YES\n");		
	}else{
		printf("NO\n");
	};
}

int gaso(char *M, char *N, int Msu){
	int i, hit, correct;
	
	hit = 0;
	
	for(i=0 ; i < Msu ; i++){
		if(M[i] == N[i]){
			hit++;
		}else{
			continue;
		};
	}
	
	if(hit == Msu){
		correct = 1;	
	}else{
		correct = 0;
	};
	//printf("correct:%d \n", correct);//
	
	return correct;
}