Let's introduce the designation <image>, where x is a string, n is a positive integer and operation " + " is the string concatenation operation. For example, [abc, 2] = abcabc.

We'll say that string s can be obtained from string t, if we can remove some characters from string t and obtain string s. For example, strings ab and aсba can be obtained from string xacbac, and strings bx and aaa cannot be obtained from it.

Sereja has two strings, w = [a, b] and q = [c, d]. He wants to find such maximum integer p (p > 0), that [q, p] can be obtained from string w.

Input

The first line contains two integers b, d (1 ≤ b, d ≤ 107). The second line contains string a. The third line contains string c. The given strings are not empty and consist of lowercase English letters. Their lengths do not exceed 100.

Output

In a single line print an integer — the largest number p. If the required value of p doesn't exist, print 0.

Examples

Input

10 3
abab
bab


Output

3

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 *
 *
 * 3 2 3 5
 * -2 -1 4 -1 2 7 3
 *
 * 10 1 -10617 30886 -7223 -63085 47793 -61665 -14614 60492 16649 -58579 3 8 1
 * 10 4 7 1 7 3 7
 *
 * 22862 -34877
 *
 * @author pttrung
 */
public class B_Round_187_Div1 {

    public static long MOD = 1000000007;
    static int[] X = {0, 1};
    static int[] Y = {1, 0};
    static long[][][] dp, dp2;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
        PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        long n = in.nextInt();
        long m = in.nextInt();
        String a = in.next();
        String b = in.next();
        dp = new long[a.length()][a.length()][b.length()];
        dp2 = new long[a.length()][a.length()][2];
        for (long[][] x : dp) {
            for (long[] y : x) {
                Arrays.fill(y, -1);
            }
        }
        for (long[][] x : dp2) {
            for (long[] y : x) {
                Arrays.fill(y, -1);
            }
        }
        boolean ok = true;
        for (int i = 0; i < a.length(); i++) {
            if (dp[0][i][0] == -1) {
                cal(0, i, 0, a, b);
                if (dp[0][i][0] == -2) {
                    ok = false;
                    break;
                }
            }
        }
        if (ok) {
            int start = 0;
            long total = 0;
            int l = a.length();
            int[]mark = new int[l];
            long []num = new long[l];
            Arrays.fill(mark,-1);
            int end = -1;
            for(int i = 0; i <= l; i++){
                if(mark[start] != -1){                    
                    end = start;
                    break;
                }
                long tmp = Long.MAX_VALUE;
                int nxt = -1;
                for(int j = 0; j < l; j++){
                    int pos = (start + j) % a.length();
                    if(j + dp[0][pos][0] < tmp){
                        tmp = j + dp[0][pos][0];
                        nxt = (int) ((start + j + dp[0][pos][0])% l);
                    }
                }
                total += tmp;
                mark[start] = nxt;
                num[start] = tmp;
                start = nxt;
            }
           
            int cur = 0;
            int nxt = start;
            long last = 0;
            long cycle = 0;
            long whole = n*l;
            int first = 0;
            int second = 0;
            do{
               last += num[cur];
               cur = mark[cur];
               first++;
            }while(cur != end);
            do{
               cycle += num[cur];
               cur = mark[cur];
               second++;
            }while(cur != end);
            int result = 0;
            if(whole >= last){
                whole -= last;
                result += first;
            }
            long x = whole/cycle;
            result += (int)x*second;
            
            long left = whole % cycle;
            cur = end;
            while(true){
                left -= num[cur];
                if(left >= 0){
                    result++;
                    cur = mark[cur];
                }else{
                    break;
                }
            }
            
            out.println(result/m);
        } else {
            out.println(0);
        }
        out.close();
    }

    static long cal(int count, int i, int j, String a, String b) {
        if (count == a.length()) {
            return -2;
        }
        if (j == b.length()) {
            return 0;
        }

        if (dp[count][i][j] != -1) {
            return dp[count][i][j];
        }
        char x = a.charAt(i);
        char y = b.charAt(j);
        long result = -2;
        if (x == y) {
            long tmp = cal(0, (i + 1) % a.length(), j + 1, a, b);
            if (tmp >= 0) {
                result = tmp + 1;
            }
        }
        long tmp = cal(count + 1, (i + 1) % a.length(), j, a, b);
        if (tmp >= 0) {
            if (result == -2 || result > tmp + 1) {
                result = tmp + 1;
            }
        }
        return dp[count][i][j] = result;
    }


    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;



    }

    public static class Point implements Comparable<Point> {

        int x, y;

        public Point(int start, int end) {
            this.x = start;
            this.y = end;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            return x - o.x;
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;


        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}
