You are given two strings s and t. The string s consists of lowercase Latin letters and at most one wildcard character '*', the string t consists only of lowercase Latin letters. The length of the string s equals n, the length of the string t equals m.

The wildcard character '*' in the string s (if any) can be replaced with an arbitrary sequence (possibly empty) of lowercase Latin letters. No other character of s can be replaced with anything. If it is possible to replace a wildcard character '*' in s to obtain a string t, then the string t matches the pattern s.

For example, if s="aba*aba" then the following strings match it "abaaba", "abacaba" and "abazzzaba", but the following strings do not match: "ababa", "abcaaba", "codeforces", "aba1aba", "aba?aba".

If the given string t matches the given string s, print "YES", otherwise print "NO".

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 2 ⋅ 10^5) — the length of the string s and the length of the string t, respectively.

The second line contains string s of length n, which consists of lowercase Latin letters and at most one wildcard character '*'.

The third line contains string t of length m, which consists only of lowercase Latin letters.

Output

Print "YES" (without quotes), if you can obtain the string t from the string s. Otherwise print "NO" (without quotes).

Examples

Input

6 10
code*s
codeforces


Output

YES


Input

6 5
vk*cup
vkcup


Output

YES


Input

1 1
v
k


Output

NO


Input

9 6
gfgf*gfgf
gfgfgf


Output

NO

Note

In the first example a wildcard character '*' can be replaced with a string "force". So the string s after this replacement is "codeforces" and the answer is "YES".

In the second example a wildcard character '*' can be replaced with an empty string. So the string s after this replacement is "vkcup" and the answer is "YES".

There is no wildcard character '*' in the third example and the strings "v" and "k" are different so the answer is "NO".

In the fourth example there is no such replacement of a wildcard character '*' that you can obtain the string t so the answer is "NO".
import java.util.*;
import java.io.*;

public class File {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        String s = sc.next(); // Length N
        String t = sc.next(); // Length M

        // Even if we replace '*' with empty, we cannot.
        // Characters cannot be removed, only added.
        if (M < N - 1) {
            System.out.println("NO");
            return;
        }

        int starIndex = s.indexOf('*');

        if (starIndex == -1) {
            if (s.equals(t)) {
                System.out.println("YES");
            }
            else {
                System.out.println("NO");
            }
        }
        else {
            int left = 0;
            int right = M - 1;

            for (int i = 0; i < starIndex; i++) {
                if (left > right || (left < M && t.charAt(left) != s.charAt(i))) {
                    System.out.println("NO");
                    return;
                }
                left++;
            }

            for (int j = N-1; j > starIndex; j--) {
                if (right < left || (right >= left && t.charAt(right) != s.charAt(j))) {
                    System.out.println("NO");
                    return;
                }
                right--;
            }
            // Make sure all characters right of '*' in s
            // match from the right in t.

            System.out.println("YES");
        }
    }
}
