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. 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemBOnceAgain solver = new ProblemBOnceAgain();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemBOnceAgain {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.readInt();
            int t = in.readInt();
            int[] a = in.readIntArray(n);
            int[] cnt = new int[400];
            for (int i : a) cnt[i]++;

            int[] b = new int[n * n];
            int[] d = new int[n * n];
            for (int i = 0; i < Math.min(n, n); i++) {
                for (int j = 0; j < n; j++) {
                    b[i * n + j] = a[j];
                }
            }
            int[] pre = new int[n * n];
            int[] len = new int[400];
            for (int i = 0; i < n * n; i++) {
                pre[i] = len[b[i]] + 1;
                for (int j = b[i]; j <= 300; j++) len[j] = Math.max(len[j], pre[i]);
            }

            int[] post = new int[400];
            for (int i = n * n - 1; i >= 0; i--) {
                int v = post[b[i]] + 1;
                for (int j = b[i]; j >= 0; j--) post[j] = Math.max(post[j], v);
            }

            int ans = 0;
            if (t <= n) {
                for (int i = 0; i < n * t; i++) {
                    ans = Math.max(ans, pre[i]);
                }
            } else {
                for (int i = 0; i < n * Math.min(n, t - n); i++) {
                    int max = 0;
                    for (int j = b[i]; j <= 300; j++) max = Math.max(max, post[j]);
                    ans = Math.max(ans, pre[i] + max + Math.max(0, t - 2 * n) * cnt[b[i]]);
                }
            }
            out.println(ans);


        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int[] readIntArray(int size) {
            int[] ans = new int[size];
            for (int i = 0; i < size; i++) ans[i] = readInt();
            return ans;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

