#include <bits/stdc++.h>
using namespace std;
const int maxn = 21234;
int lis[maxn];
int getLis(int *arr, int len) {
  int ans = 1;
  lis[1] = arr[1];
  for (int i = 2; i <= len; i++) {
    if (arr[i] >= lis[ans]) {
      lis[++ans] = arr[i];
    } else {
      int loc = upper_bound(lis + 1, lis + 1 + ans, arr[i]) - lis;
      lis[loc] = arr[i];
    }
    for (int i = 1; i <= ans; i++) {
    }
  }
  return ans;
}
int cnt[maxn];
int arr[maxn];
int main() {
  int n, T;
  scanf("%d%d", &n, &T);
  memset(cnt, 0, sizeof(cnt));
  int maxIndex = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
    cnt[arr[i]]++;
    if (cnt[arr[i]] > maxIndex) {
      maxIndex = i;
    }
  }
  int maxCnt = 0;
  for (int i = 0; i <= 310; i++) {
    if (cnt[i] >= maxCnt) {
      maxCnt = cnt[i];
    }
  }
  if (T < n) {
    for (int i = 2; i <= T; i++) {
      for (int j = 1; j <= n; j++) {
        arr[(i - 1) * n + j] = arr[j];
      }
    }
    int len = n * T;
    for (int i = 1; i <= len; i++) {
    }
    printf("%d\n", getLis(arr, len));
  } else {
    for (int i = 2; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        arr[(i - 1) * n + j] = arr[j];
      }
    }
    int len = n * n;
    int ans = getLis(arr, len) + maxCnt * (T - n);
    printf("%d\n", ans);
  }
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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. 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 21234;
int lis[maxn];
int getLis(int *arr, int len) {
  int ans = 1;
  lis[1] = arr[1];
  for (int i = 2; i <= len; i++) {
    if (arr[i] >= lis[ans]) {
      lis[++ans] = arr[i];
    } else {
      int loc = upper_bound(lis + 1, lis + 1 + ans, arr[i]) - lis;
      lis[loc] = arr[i];
    }
    for (int i = 1; i <= ans; i++) {
    }
  }
  return ans;
}
int cnt[maxn];
int arr[maxn];
int main() {
  int n, T;
  scanf("%d%d", &n, &T);
  memset(cnt, 0, sizeof(cnt));
  int maxIndex = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
    cnt[arr[i]]++;
    if (cnt[arr[i]] > maxIndex) {
      maxIndex = i;
    }
  }
  int maxCnt = 0;
  for (int i = 0; i <= 310; i++) {
    if (cnt[i] >= maxCnt) {
      maxCnt = cnt[i];
    }
  }
  if (T < n) {
    for (int i = 2; i <= T; i++) {
      for (int j = 1; j <= n; j++) {
        arr[(i - 1) * n + j] = arr[j];
      }
    }
    int len = n * T;
    for (int i = 1; i <= len; i++) {
    }
    printf("%d\n", getLis(arr, len));
  } else {
    for (int i = 2; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        arr[(i - 1) * n + j] = arr[j];
      }
    }
    int len = n * n;
    int ans = getLis(arr, len) + maxCnt * (T - n);
    printf("%d\n", ans);
  }
  return 0;
}

```