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.

Examples

Input

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


Output

Yes


Input

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


Output

Yes


Input

4 1
....
....
....
....


Output

No
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in)) {
			int N = sc.nextInt();
			int M = sc.nextInt();
			String[] nmap = new String[N];
			String[] mmap = new String[M];
			int nwcnt = 0;
			int nbcnt = 0;
			int mwcnt = 0;
			int mbcnt = 0;
			for (int i = 0; i < N; i++) {
				nmap[i] = sc.next();
				for (char c : nmap[i].toCharArray()) {
					if (c == '.') {
						nwcnt++;
					} else {
						nbcnt++;
					}
				}
			}
			for (int i = 0; i < M; i++) {
				mmap[i] = sc.next();
				for (char c : mmap[i].toCharArray()) {
					if (c == '.') {
						mwcnt++;
					} else {
						mbcnt++;
					}
				}
			}

			boolean ngflg = true;
			int index = 0;
			for (int r = 0; r < (N - M) + 1; r++) {
				for (int mr = 0; mr < M; mr++) {
					if (mr == 0) {
						index = 0;
					}
					index = nmap[r].substring(index).indexOf(mmap[mr]);
					if (index < 0 || !nmap[r].substring(index).startsWith(mmap[mr])) {
						break;
					}
					if (mr == M - 1) {
						ngflg = false;
					}
				}
			}

			if (!ngflg) {
				System.out.println("Yes");
			} else {
				System.out.println("No");
			}
		}
	}
}