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;
int lis(int A[], int size) {
  int *lis, i, j, Max = 0;
  lis = (int *)malloc(sizeof(int) * size);
  for (i = 0; i < size; i++) {
    lis[i] = 1;
  }
  for (i = 0; i < size; i++) {
    for (j = 0; j < i; j++) {
      if (A[i] >= A[j] && lis[i] < (lis[j] + 1)) lis[i] = lis[j] + 1;
    }
  }
  Max = lis[0];
  for (i = 0; i < size; i++) {
    Max = max(Max, lis[i]);
  }
  return Max;
}
int main() {
  int n, i, T, tmp, j;
  cin >> n >> T;
  tmp = min(n, T);
  int A[n], B[tmp * n];
  for (i = 0; i < n; i++) {
    cin >> A[i];
    B[i] = A[i];
  }
  for (i = 1; i < tmp; i++) {
    for (j = 0; j < n; j++) {
      B[i * n + j] = B[j];
    }
  }
  int Ans = lis(B, tmp * n);
  int ctr = 1, Max = 1;
  sort(A, A + n);
  for (i = n - 2; i >= 0; i--) {
    if (A[i] == A[i + 1]) {
      ctr++;
    } else {
      ctr = 1;
    }
    Max = max(Max, ctr);
  }
  tmp = max(0, T - n);
  Ans += tmp * Max;
  cout << Ans << endl;
  return 0;
}
