#include <bits/stdc++.h>
using namespace std;
int n, t, a[1000000 + 5], num[300 + 5], f[1000000 + 5];
int main() {
  cin >> n >> t;
  int maxlen = min(n * n, n * t);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    num[a[i]]++;
  }
  for (int i = n + 1; i <= maxlen; i++) a[i] = a[i - n];
  f[1] = 1;
  for (int i = 2; i <= maxlen; i++) {
    for (int j = 1; j < i; j++)
      if (a[j] <= a[i]) f[i] = max(f[i], f[j]);
    f[i]++;
  }
  int ans = 0, maxnum = 0;
  for (int i = 1; i <= maxlen; i++) ans = max(ans, f[i]);
  for (int i = 1; i <= 300; i++) maxnum = max(maxnum, num[i]);
  if (n > t)
    cout << ans << endl;
  else
    cout << ans + (t - n) * maxnum << endl;
}
