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 Rust (1.15.1) (judge verdict: Accepted)

use std::io;

fn procon_read<T: std::str::FromStr>() ->  Vec<T> {
	let mut buf = String::new();
	io::stdin().read_line(&mut buf).expect("");
	let iter = buf.split_whitespace();
	let mut v: Vec<T> = Vec::new();
	for i in iter {
		v.push(i.parse().ok().unwrap());
	}
	v
}

fn main() {
	let v:Vec<i32> = procon_read();
	let n = v[0];
	let m = v[1];
	let mut a:Vec<Vec<char>> = Vec::new();
	let mut b:Vec<Vec<char>> = Vec::new();
	for i in 0..n{
		let mut buf = String::new();
		io::stdin().read_line(&mut buf).expect("");
		let cur:Vec<char> = buf.trim().chars().collect();
		a.push(cur);
	}
	for i in 0..m{
		let mut buf = String::new();
		io::stdin().read_line(&mut buf).expect("");
		let cur:Vec<char> = buf.trim().chars().collect();
		b.push(cur);
	}
	
	let mut exist = false;
	for i in 0..n {
		for j in 0..n {
			if i+m-1 >= n || j+m-1 >= n {
				continue;
			}
			let mut flag = true;
			for k in 0..m {
				for o in 0..m {
					if a[(i+k) as usize][(j+o) as usize] != b[k as usize][o as usize] {
						flag = false;
					}
				}
			}
			if flag {
				exist = true;
			}
		}
	}
	if exist {
		println!("Yes");
	}else{
		println!("No");
	}
	
}