You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of the given array.

Input

The first line contains two space-separated integers: n, T (1 ≤ n ≤ 100, 1 ≤ T ≤ 107). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 300).

Output

Print a single number — the length of a sought sequence.

Examples

Input

4 3
3 1 4 2


Output

5

Note

The array given in the sample looks like that: 3, 1, 4, 2, 3, 1, 4, 2, 3, 1, 4, 2. The elements in bold form the largest non-decreasing subsequence. 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int n, T;
int a[maxn * maxn];
int dp[maxn * maxn];
int cnt[333];
int ans;
void LIS(int k) {
  for (int i = 0; i < n * k; i++) {
    dp[i] = 1;
    for (int j = 0; j < i; j++)
      if (a[j] <= a[i]) {
        dp[i] = max(dp[i], dp[j] + 1);
      }
    ans = max(ans, dp[i]);
  }
}
int main() {
  scanf("%d%d", &n, &T);
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    cnt[a[i]]++;
    for (int j = 1; j < n; j++) a[i + j * n] = a[i];
  }
  memset(dp, 0, sizeof(dp));
  if (T <= n)
    LIS(T);
  else {
    LIS(n);
    int p = 0;
    for (int i = 0; i < n; i++) p = max(p, cnt[a[i]]);
    ans += p * (T - n);
  }
  printf("%d\n", ans);
  return 0;
}
