private static void solveMatcherPattern(String[] s1,
			String[] s2, int R, int C, int r, int c) {
		// TODO Auto-generated method stub
		for (int i = 0; i <= R - r; i++) {
			for (int j = 0; j <= C - c; j++) {
				boolean flag = true;
					for (int k = 0; k < r; k++) {
						String first = s1[i + k].substring(j, j + c);
							if (!first.equals(s2[k])) {
								flag = false;
								break;
							}
					}
					if (flag) {
						System.out.println("YES");
						return;
					}
			}
		}
		System.out.println("NO");
	}