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 = 500 + 3;
const int INF = 1e9;
int dp[MAXN][MAXN];
int ans[MAXN][MAXN];
int help[MAXN][MAXN];
int a[MAXN];
int n;
void solveT(int t) {
  if (t == 1) {
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) ans[i][j] = dp[i][j];
    return;
  }
  solveT(t / 2);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) help[i][j] = ans[i][j];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++)
        ans[i][j] = max(ans[i][j], help[i][k] + help[k][j]);
  if (t % 2 == 0) return;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) help[i][j] = ans[i][j];
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n; k++)
        ans[i][j] = max(ans[i][j], help[i][k] + dp[k][j]);
  return;
}
int main() {
  int t;
  cin >> n >> t;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (a[j] < a[i])
        dp[i][j] = -INF;
      else {
        dp[i][j] = 1;
        for (int k = 0; k < j; k++)
          if (a[k] <= a[j]) dp[i][j] = max(dp[i][j], dp[i][k] + 1);
      }
    }
  }
  solveT(t);
  int x = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) x = max(x, ans[i][j]);
  cout << x << endl;
  return 0;
}
