using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            string[] input = Console.ReadLine().Split();
            int N = int.Parse(input[0]);//A
            int M = int.Parse(input[1]);//B
            string[] A = new string[N];
            string[] B = new string[M];
            bool ans = false;

            for (int i = 0; i < N; i++)
            {
                A[i] = Console.ReadLine();
            }


            for (int i = 0; i < M; i++)
            {
                B[i] = Console.ReadLine();
            }

            for (int i = 0; i <= N - M; i++)
            {
                for (int j = 0; j <= N - M; j++)
                {
                    ans = solv(A, B, i, j);
                    if (ans == true)
                    {
                        i += 100;
                        j += 100;
                    }
                }
            }

            if (ans) Console.WriteLine("Yes");
            else Console.WriteLine("No");
        }
        static bool solv(string[] A, string[] B, int p, int q)
        {
            for (int i = p; i - p < B.Length; i++)
            {
                for (int j = q; j - q < B.Length; j++)
                {
                    if (A[i][j] != B[i - p][j - q]) return false;
                }

            }

            return true;
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 13140