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.io.*;
import java.math.BigInteger;
import java.nio.charset.MalformedInputException;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import java.util.Map.Entry;

public class GFGMs
{
    static int mod1 = (int) (1e9 + 7);

    static class Reader
    {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1)
            {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do
            {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do
            {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do
            {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.')
            {
                while ((c = read()) >= '0' && c <= '9')
                {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }

        public int[] nextArray(int n) throws IOException
        {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
            {
                a[i] = nextInt();
            }
            return a;
        }
        public Integer[] nextIntegrArray(int n) throws IOException
        {
            Integer[] a = new Integer[n];
            for (int i = 0; i < n; i++)
            {
                a[i] = nextInt();
            }
            return a;
        }
    }

    static long power(long x, long y, long p )
    {
        // Initialize result
        long res = 1;

        // Update x if it is more
        // than or equal to p
        x = x % p;

        while (y > 0)
        {
            // If y is odd, multiply x
            // with result
            if((y & 1)==1)
            {
                BigInteger res0 = BigInteger.valueOf(res);
                res0=res0.multiply(BigInteger.valueOf(x));
                res0=res0.mod(BigInteger.valueOf(p));
                String str0=res0.toString();
                res=Long.parseLong(str0);
            }
            // y must be even now
            // y = y / 2
            y = y >> 1;

            BigInteger res00=BigInteger.valueOf(x);
            res00=res00.multiply(BigInteger.valueOf(x));
            res00=res00.mod(BigInteger.valueOf(p));
            String ans00=res00.toString();
            x=Long.parseLong(ans00);

        }
        return res;
    }

    static boolean primeCheck(long num0)
    {
        boolean b1 = true;
        long num01 = (long) (Math.sqrt(num0)) + 1;
        me1:for (long m = 2; m < num01; m++)
        {
            if (num0 % m == 0)
            {
                b1 = false;
                break me1;
            }
        }
        if (num0 == 1 || num0 == 0)
        {
            b1 = false;
        }
        return b1;
    }

    static long pow1(long x, long y, long p)
    {
        // Initialize result
        long res = 1;

        // Update x if it is more
        // than or equal to p
        x = x % p;

        while (y > 0)
        {
            // If y is odd, multiply x
            // with result
            if ((y & 1) == 1)
                res = (res * x) % p;

            // y must be even now
            // y = y / 2
            y = y >> 1;
            x = (x * x) % p;
        }
        return res;
    }


    static int find(int pos1, char chr1, String str0)
    {
        int num5 = -1;
        int len0 = str0.length();
        me0:
        for (int i = pos1; i < len0; i++)
        {
            if (str0.charAt(i) == chr1)
            {
                num5 = i;
                break me0;
            }
        }
        return num5;
    }

    static long gcd(long a, long b)
    {
        if (a == 0 || b == 0)
            return (a+b);
        if (a == b)
            return a;
        if (a > b)
            return gcd(a - b, b);
        return gcd(a, b - a);
    }

    static void insertionSort(int arr[], int n)
    {
        int i, key, j;
        for (i = 1; i < n; i++)
        {
            key = arr[i];
            j = i - 1;

            while (j >= 0 && arr[j] > key)
            {
                arr[j + 1] = arr[j];
                j = j - 1;
            }
            arr[j + 1] = key;
            print(arr, n);
        }
    }

    static void print(int arr[], int n)
    {
        for (int i = 0; i < n; i++)
        {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }


    static long fact(long num7)
    {
        long num9=1;
        for(int i=2;i<num7+1;i++)
        {
            num9=(num9*i)%mod1;
        }
        return num9;
    }
    static void del(int[] arr0,int num1)
    {
        int len1=arr0.length;
        boolean b1=false;
        me1: for(int i=0;i<len1;i++)
        {
            if(arr0[i]==num1)
            {
                b1=true;
                break me1;
            }
        }
        System.out.println(b1);
    }

    public static ArrayList<Integer> prime(int num0)
    {
        ArrayList<Integer> set1=new ArrayList<>();
        while (num0%2==0)
        {
            set1.add(2);
            num0/= 2;
        }

        for (int i = 3; i <= Math.sqrt(num0); i+= 2)
        {
            while (num0%i == 0)
            {
                set1.add(i);
                num0/= i;
            }
        }
        if (num0>2)
        {
            set1.add(num0);
        }
        return set1;
    }

    static BigInteger fact(int num0)
    {
        BigInteger fact1=new BigInteger("1");
        for(int i=2;i<num0+1;i++)
        {
            fact1=fact1.multiply(BigInteger.valueOf(i));
        }
        return fact1;
    }


    public static void main(String[] args) throws IOException
    {
        //Reader r=new Reader();
        Scanner r = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        OutputWriter out1 = new OutputWriter(System.out);
        {
            int len1=r.nextInt();
            int len2=r.nextInt();
            String str1=r.next();
            String str2=r.next();
            String ans1="YES";
            if(len1-1>len2)
            {
                ans1="NO";
            }
            else if(!str1.contains("*"))
            {
                if(!str1.equals(str2))
                {
                    ans1="NO";
                }
            }
            else
            {
                int pos1=0;
                while (str1.charAt(pos1)!='*')
                {
                    if(str1.charAt(pos1)!=str2.charAt(pos1))
                    {
                        out1.print("NO"+"");
                        out1.close();
                        return;
                    }
                    pos1++;
                }
                int pos2=len1-1;
                int pos3=len2-1;
                while(str1.charAt(pos2)!='*')
                {
                    if(str1.charAt(pos2) != str2.charAt(pos3) && pos3>=pos1)
                    {
                        out1.print("NO"+"");
                        out1.close();
                        return;
                    }
                    pos2--;
                    pos3--;
                }
            }
            out1.print(ans1+"");
        }
        out1.close();
    }
}

class OutputWriter{
    BufferedWriter writer;

    public OutputWriter(OutputStream stream){
        writer = new BufferedWriter(new OutputStreamWriter(stream));
    }

    public void print(int i) throws IOException {
        writer.write(i);
    }

    public void print(String s) throws IOException {
        writer.write(s);
    }

    public void print(char []c) throws IOException {
        writer.write(c);
    }
    public  void close() throws IOException {
        writer.close();
    }
}