#include <bits/stdc++.h>
using namespace std;
int now[10005], dp[30005], aim[10005];
int main() {
  long long t;
  int n, maxn = 0;
  scanf("%d%lld", &n, &t);
  for (int i = 0; i < n; i++) {
    scanf("%d", &now[i]);
    aim[now[i]]++;
    maxn = max(aim[now[i]], maxn);
  }
  int l = n;
  while ((--t) && l < 10000) {
    for (int i = 0; i < n; i++) now[l++] = now[i];
  }
  int ans = 0;
  for (int i = 0; i < l; i++) {
    dp[i]++;
    for (int j = 0; j < i; j++)
      if (now[i] >= now[j]) dp[i] = max(dp[i], dp[j] + 1);
    ans = max(ans, dp[i]);
  }
  printf("%d\n", ans + t * maxn);
  return 0;
}
