#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1000000000000000000LL;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T k) {
  return k >= 0 ? k : -k;
}
template <class T>
T sqr(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
template <class T>
T addmod(T a, T b, T c) {
  return (T)((long long)(a + b) % c);
}
template <class T>
T mulmod(T a, T b, T c) {
  return (T)((long long)a * b % c);
}
template <class T>
T powmod(T a, T b, T c) {
  return (T)(b ? sqr((long long)powmod(a, b >> 1, c)) % c * (b & 1 ? a : 1) % c
               : 1);
}
template <class T>
void maxe(T &a, T b) {
  a = max(a, b);
}
template <class T>
void mine(T &a, T b) {
  a = min(a, b);
}
template <class T>
void mode(T &a, T b) {
  a = mod(a, b);
}
template <class T>
void addmode(T &a, T b, T c) {
  a = addmod(a, b, c);
}
template <class T>
void mulmode(T &a, T b, T c) {
  a = mulmod(a, b, c);
}
template <class T>
void powmode(T &a, T b, T c) {
  a = powmod(a, b, c);
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 1111111;
int test;
int n, m, k, ans;
int len1, len2;
char s1[N], s2[N];
int a[N], b[N];
int x, y;
int cnt;
int main() {
  scanf("%d%d%s%s", &n, &m, s1 + 1, s2 + 1);
  len1 = strlen(s1 + 1);
  len2 = strlen(s2 + 1);
  for (int i = 1; i <= len2; i++) {
    x = 0;
    y = i;
    for (int j = 1; j <= len1; j++) {
      if (s1[j] == s2[y]) {
        y++;
        if (y > len2) {
          x++;
          y = 1;
        }
      }
    }
    a[i] = x;
    b[i] = y;
  }
  k = 1;
  for (int i = 1; i <= n; i++) {
    cnt += a[k];
    k = b[k];
  }
  ans = cnt / m;
  printf("%d\n", ans);
  return 0;
}
