import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

enum MAX = 1_000_100;
ulong MOD = 1_000_000_007;
ulong INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias INCOME = Tuple!(long, "after", long, "salary");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

void main()
{
    long n, m;
    scan(n, m);
    auto a = new string[](n);
    auto b = new string[](m);
    foreach (ref e; a)
        e = sread();
    foreach (ref e; b)
        e = sread();
    bool flag;
    foreach (i; iota(n - m + 1))
    {
        foreach (j; iota(n - m + 1))
        {
            bool check = true;
            foreach (col; iota(m))
            {
                foreach (row; iota(m))
                {
                    if (a[i + col][j + row] != b[col][row])
                        check = false;
                }
            }
            flag = flag || check;
        }
    }

    if (flag)
        writeln("Yes");
    else
        writeln("No");
}

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
