#include <bits/stdc++.h>
using namespace std;
const int INF = 1061109567;
const long long LINF = 4557430888798830399ll;
const int MOD = 1000000007;
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  if (c == EOF) exit(0);
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    x = x * 10 + (c - '0');
    c = getchar();
  }
  assert(c != EOF);
}
int reads(char *s) {
  int l = 0;
  *s = getchar();
  if (*s == EOF) exit(0);
  while (*s != ' ' && *s != '\t' && *s != '\r' && *s != '\n' && *s != EOF) {
    ++s;
    ++l;
    *s = getchar();
  }
  assert(*s != EOF);
  *s = '\0';
  return l;
}
long long qpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
char s[200005], t[200005];
void test_case() {
  int n, m;
  scanf("%d%d%s%s", &n, &m, s + 1, t + 1);
  if (m < n - 1) {
    puts("NO");
    return;
  }
  int x = -1;
  for (int i = 1; i <= n; ++i) {
    if (s[i] == '*') {
      x = i;
      break;
    }
  }
  if (x == -1) {
    if (strcmp(s + 1, t + 1) == 0)
      puts("YES");
    else
      puts("NO");
    return;
  }
  for (int i = 1; i <= x - 1; ++i) {
    if (s[i] != t[i]) {
      puts("NO");
      return;
    }
  }
  for (int i = n, j = m; i >= x + 1; --i, --j) {
    if (s[i] != t[j]) {
      puts("NO");
      return;
    }
  }
  puts("YES");
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    test_case();
  }
}
