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;
template <class T>
inline void smax(T &x, T y) {
  x = max((x), (y));
}
template <class T>
inline void smin(T &x, T y) {
  x = min((x), (y));
}
const int MOD = 1e9 + 7;
const int SIZE = 3 * 1e2 + 10;
const int INF = 0x3f3f3f3f;
typedef int Mat[SIZE][SIZE];
int n, T;
int A[SIZE];
Mat a, mt, tmp;
void mult(const Mat foo, const Mat bar, Mat r) {
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (n); ++j) {
      tmp[i][j] = -INF;
      for (int k = 0; k < (n); ++k) {
        smax(tmp[i][j], foo[i][k] + bar[k][j]);
      }
    }
  for (int i = 0; i < (n); ++i)
    for (int j = 0; j < (n); ++j) r[i][j] = tmp[i][j];
}
int main() {
  if (0) {
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
  }
  while (scanf("%d%d", &(n), &(T)) == 2) {
    for (int i = 0; i < (n); ++i) {
      scanf("%d", &(A[i]));
    }
    for (int s = 0; s < (n); ++s) {
      for (int i = 0; i < (n); ++i) {
        if (A[i] < A[s]) {
          a[s][i] = -INF;
        } else {
          a[s][i] = 1;
          for (int j = 0; j < (i); ++j)
            if (A[i] >= A[j]) smax(a[s][i], a[s][j] + 1);
        }
      }
    }
    memset((mt), 0, sizeof((mt)));
    for (int p = T; p > 0; p >>= 1, mult(a, a, a))
      if (p & 1) mult(a, mt, mt);
    int ma = 0;
    for (int i = 0; i < (n); ++i)
      for (int j = 0; j < (n); ++j) smax(ma, mt[i][j]);
    printf("%d\n", ma);
  }
  return 0;
}
