You are given an array of positive integers a1,a2,...,an \times T of length n \times T. We know that for any i \gt n it is true that ai=ai-n. Find the length of the longest non-decreasing sequence of the given array.

The first line contains two space-separated integers: n, T (1 \le n \le 100, 1 \le T \le 107). The second line contains n space-separated integers a1,a2,...,an (1 \le ai \le 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.