CF582B.Once Again...

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

给你一个长度为 $ n \times T $ 的正整数数组 $ a_1, a_2, ..., a_{n \times T} $。已知对任意 $ i > n $，都有 $ a_i = a_{i - n} $。求该数组中最长非递减子序列的长度。

The first line contains two space-separated integers: n, T (1 ≤ n ≤ 100, 1 ≤ T ≤ 107). The second line contains n space-separated integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 300).

第一行包含两个用空格分隔的整数：$n$、$T$（$1 ≤ n ≤ 100$，$1 ≤ T ≤ 10^7$）。第二行包含 $n$ 个用空格分隔的整数 $a_1, a_2, ..., a_n$（$1 ≤ a_i ≤ 300$）。

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

输出一个整数——所求序列的长度。

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.

样例中给出的数组如下：3, 1, 4, 2, 3, 1, 4, 2, 3, 1, 4, 2。其中加粗的元素构成了最长的非递减子序列。