The Cakewalk

Lakshmi Narayanan is so fond of arrays. His friend Siva gifted him an array of positive integers of size n x T. The array has the property, for any i > n, a[i] = a[i - n]. He is interested in knowing the length of the longest non-decreasing subsequence of the given array. Input The first line contains two space-separated integers: n, T (1 ≤ n ≤ 100, 1 ≤ T ≤ 10^7). The second line contains n s