#include<cstdio>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #include<map>

 #include<set>

 #include<queue>

 #include<vector>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef vector<int> VI;

 #define fi first

 #define se second

 #define MP make_pair

 #define N   210000

 #define MOD 1000000007

 #define eps 1e-8

 #define pi acos(-1)

 #define oo 2000000000

 char s[N],t[N],c[N];

 int read()

 {

    int v=,f=;

    char c=getchar();

    while(c<||<c) {if(c=='-') f=-; c=getchar();}

    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();

    return v*f;

 }

 void swap(int &x,int &y)

 {

     int t=x;x=y;y=t;

 }

 int main()

 {

 //    freopen("1.in","r",stdin);

 //    freopen("1.out","w",stdout);

     int n,m;

     scanf("%d%d",&n,&m);

     scanf("%s",s);

     scanf("%s",t);

     int flag=;

     int p=-;

     for(int i=;i<=n-;i++)

      if(s[i]=='*'){flag=; p=i; break;}

 //    printf("%d\n",flag);

     if(!flag)

     {

         int ans=;

         if(n!=m) ans=;

         for(int i=;i<=n-;i++)

          if(s[i]!=t[i]){ans=; break;}

         if(ans) printf("YES\n");

          else printf("NO\n");

     }

      else

      {

          int flag1=;

          for(int i=;i<=p-;i++)

           if(s[i]!=t[i]){flag1=; break;}

          int flag2=;

          int k=m-;

         for(int i=n-;i>=p+;i--)

         {

              if(s[i]!=t[k]){flag2=; break;}

              k--;

         }

         if(n-<=m&&flag1+flag2==) printf("YES\n");

          else printf("NO\n");

     }

     return ;

 }