#include <bits/stdc++.h>

using namespace std;
#define MOD 1000000007
#define pi 3.1415926535897932384626433832795028841971693993751058209749445923078164062
const int INF = 1e9;
#define ll long long
#define pb push_back
#define pf push_front
#define mp make_pair
#define mt make_tuple
#define ub upper_bound
#define lb lower_bound
#define popb pop_back()
#define popf pop_front()
#define ff first
#define ss second
#define vl vector<ll>
#define vi vector<int>
#define vs vector<string>
#define vll vector< pair<ll,ll> >
#define vii vector< pair<int,int> >
#define viii vector< tuple <int,int,int> >
#define vlll vector< tuple <ll,ll,ll> >
#define vvl vector<vector<ll>>
#define vv vector<vector<int>>
#define all(v) v.begin(),v.end()
#define sqrt sqrtl
#define cbrt cbrtl
#define pll pair<ll,ll>
#define pii pair<int,int>
#define mapcl map<char,ll>
#define mapci map<char,int>
#define mapll map<ll,ll>
#define mapii map<int,int>
#define seti set<int>
ifstream fin("input.txt");
ofstream fout("output.txt");
#define FOR(i, l, r) for (int i = int(l); i < int(r); ++i)
#define print(a)       for(auto x : a) cout << x << " "; cout << "\n"
#define print1(a)      for(auto x : a) cout << x.ff << " " << x.ss << "\n"
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << "\n"


ll fast_exp(ll base, ll exp) {ll res=1;while(exp>0) {if(exp%2==1) res=(res*base)%MOD;base=(base*base)%MOD;exp/=2;}return res%MOD;}
int gcd(int a,int b){while (a&&b)a>b?a%=b:b%=a;return a+b;}
int val(char c){if (c >= '0' && c <= '9')return (int)c - '0';else return (int)c - 'A' + 10;}
ll pows(int a , int b){ll res=1;for(int i=0; i<b; ++i){res*=a;}return res;}
ll logx(ll base, ll num){int cnt=0;while(num!=1){num/=base; ++cnt;}return cnt;}
ll divisibles(ll a, ll b, ll m){if(a%m==0)return (b/m)-(a/m)+1;else return (b/m)-(a/m);}// in [a,b]
string bitstring(int n, int size){string s;while(n){s+=(n%2)+'0';n/=2;}while(s.size()<size){s+='0';}reverse(all(s));return s;}
// dsu start

vi root(200001,0);
vi size(200001,1);
int find(int x){while(x!=root[x])x = root[x];return x;}
bool same(int a,int b){return find(a)==find(b);}
void unite(int a, int b){a = find(a);b = find(b);if(size[a]<size[b])swap(a,b);size[a] += size[b];root[b] = a;}

// dsu end
vi vis(200001,0);
vi adj[200001];

int main()
{	
    std::ios::sync_with_stdio(false);
    //string bitstring = std::bitset< 3 >( 7 ).to_string(); <bits> (num)
    //srand(time(0));
    //cin.tie(NULL);
    //cout.tie(NULL);
 	int a[50][50];
 	int b[50][50];
 	int c[50][50];
 	int n,m;
 	cin>>n>>m;
 	for(int i=0; i<50; ++i)
 		for(int j=0; j<50; ++j)
 			c[i][j]=3;
 	for(int i=0; i<n; ++i)
 	{
 		string s;
 		cin>>s;
 		for(int j=0; j<s.size(); ++j)
 		{
 			if(s[j]=='#')
 				a[i][j] = 0;
 			else
 				a[i][j] = 1;
 		}
 	}
 	for(int i=0; i<m; ++i)
 	{
 		string s;
 		cin>>s;
 		for(int j=0; j<s.size(); ++j)
 		{
 			if(s[j]=='#')
 				b[i][j] = 0;
 			else
 				b[i][j] = 1;
 		}
 	}

 	int flag = 0;
 	for(int i=0; i<n; ++i)
 	{
 		for(int j=0; j<n; ++j)
 		{
 			int cx = 0;
 			int cy = 0;
 			for(int k=i; k<i+m; ++k)
 			{
 				for(int l=j; l<j+m; ++l)
 				{
 					if(j+m-1>=n || i+m-1>=n)
 						break;
 					c[cx][cy] = a[k][l];
 						++cy;
 					if(cy>=m)
 					{
 						cy = 0;
 						++cx;
 					}
 				}
 			}
 			int flagx=0;
 			for(int k=0; k<m; ++k)
 			{
 				for(int l=0; l<m; ++l)
 				{
 					if(c[k][l]!=b[k][l])
 					{
 						++flagx;
 						break;
 					}
 				}
 				if(flagx==1)
 					break;
 			}
 			for(int i=0; i<50; ++i)
 				for(int j=0; j<50; ++j)
 					c[i][j]=3;
 			if(flagx==0)
 				flag=1;
 		}
 	}
 	if(flag)
 		cout<<"Yes"<<"\n";
 	else
 		cout<<"No"<<"\n";

}

Measured memory_bytes: 7296