#include <bits/stdc++.h>
#define inf INT_MAX
#define NN INT_MIN
typedef long long ll;
using namespace std;
char c[2000005];
int f[2000005], f2[200005];
int main()
{
#ifdef WHX_AK_IOI
   // freopen("data.in", "r", stdin);
// freopen("dataout.txt","w",stdout);
#endif
   ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
   int ccc, m;
   cin >> ccc >> m;
   scanf("%s", c + 1);
   int n = strlen(c + 1);
   // cout << n << endl;
   for (int i = 2; i <= n; i++)
   {
      int j = f[i - 1];
      while (j > 0 && c[j + 1] != c[i])
         j = f[j];
      if (c[j + 1] == c[i] && (j + 1) * 2 < i)
         f[i] = j + 1;
      else
         f[i] = 0;
   }
   cout << (m - f[n]) / f[n] << endl;
   // cout << 111 << endl;
   // for (int i = 1; i <= n; i++)
   //    cout << f[i] << ' ';
   // cout << endl;
   // system("pause");
   return 0;
}