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.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Iterator;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

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

    static class TaskB {
        int MAX = 300;
        int[] a;
        int[][][] mem;
        int[][] pdmem;

        int dp(int index, int smallest, int largest) {
            if(index == a.length) return 0;
            if(mem[index][smallest][largest] != -1) return mem[index][smallest][largest];
            int res = dp(index + 1, smallest, largest);
            if(a[index] >= smallest && a[index] <= largest) res = Math.max(res, 1 + dp(index + 1, a[index], largest));
            return mem[index][smallest][largest] = res;
        }

        int pd(int index, int minval) {
            if(index == 0) return 0;
            if(pdmem[index][minval] != -1) return pdmem[index][minval];
            int res = 0;
            for(int nextmin = minval; nextmin < MAX; nextmin++) {
                res = Math.max(res, pd(index - 1, nextmin) + dp(0, minval, nextmin));
            }
            return pdmem[index][minval] = res;
        }

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.readInt(), t = in.readInt();
            a = IOUtils.readIntArray(in, n);
            for(int i = 0; i < a.length; i++) a[i]--;
            mem = new int[a.length][MAX][MAX];
            ArrayUtils.fill(mem, -1);
            int[] count = new int[MAX];
            for(int val : a) count[val]++;
            int maxcount = ArrayUtils.maxElement(count);
            int mainiters = Math.min(t, MAX);
            pdmem = new int[mainiters + 1][MAX];
            ArrayUtils.fill(pdmem, -1);
            int mainres = pd(mainiters, 0);
            int otherres = maxcount * (t - mainiters);
            out.printLine(mainres + otherres);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private 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 interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void printLine(int i) {
            writer.println(i);
        }

    }

    static interface IntStream extends Iterable<Integer>, Comparable<IntStream> {
        public IntIterator intIterator();

        default public Iterator<Integer> iterator() {
            return new Iterator<Integer>() {
                private IntIterator it = intIterator();

                public boolean hasNext() {
                    return it.isValid();
                }

                public Integer next() {
                    int result = it.value();
                    it.advance();
                    return result;
                }
            };
        }

        default public int compareTo(IntStream c) {
            IntIterator it = intIterator();
            IntIterator jt = c.intIterator();
            while(it.isValid() && jt.isValid()) {
                int i = it.value();
                int j = jt.value();
                if(i < j) {
                    return -1;
                } else if(i > j) {
                    return 1;
                }
                it.advance();
                jt.advance();
            }
            if(it.isValid()) {
                return 1;
            }
            if(jt.isValid()) {
                return -1;
            }
            return 0;
        }

        default public int max() {
            int result = Integer.MIN_VALUE;
            for(IntIterator it = intIterator(); it.isValid(); it.advance()) {
                int current = it.value();
                if(current > result) {
                    result = current;
                }
            }
            return result;
        }

    }

    static class ArrayUtils {
        public static void fill(int[][] array, int value) {
            for(int[] row : array)
                Arrays.fill(row, value);
        }

        public static void fill(int[][][] array, int value) {
            for(int[][] subArray : array)
                fill(subArray, value);
        }

        public static int maxElement(int[] array) {
            return new IntArray(array).max();
        }

    }

    static abstract class IntAbstractStream implements IntStream {

        public String toString() {
            StringBuilder builder = new StringBuilder();
            boolean first = true;
            for(IntIterator it = intIterator(); it.isValid(); it.advance()) {
                if(first) {
                    first = false;
                } else {
                    builder.append(' ');
                }
                builder.append(it.value());
            }
            return builder.toString();
        }


        public boolean equals(Object o) {
            if(!(o instanceof IntStream)) {
                return false;
            }
            IntStream c = (IntStream) o;
            IntIterator it = intIterator();
            IntIterator jt = c.intIterator();
            while(it.isValid() && jt.isValid()) {
                if(it.value() != jt.value()) {
                    return false;
                }
                it.advance();
                jt.advance();
            }
            return !it.isValid() && !jt.isValid();
        }


        public int hashCode() {
            int result = 0;
            for(IntIterator it = intIterator(); it.isValid(); it.advance()) {
                result *= 31;
                result += it.value();
            }
            return result;
        }

    }

    static interface IntReversableCollection extends IntCollection {
    }

    static class IOUtils {
        public static int[] readIntArray(InputReader in, int size) {
            int[] array = new int[size];
            for(int i = 0; i < size; i++)
                array[i] = in.readInt();
            return array;
        }

    }

    static interface IntCollection extends IntStream {
        public int size();

    }

    static interface IntList extends IntReversableCollection {
        public abstract int get(int index);

        public abstract void removeAt(int index);

        default public IntIterator intIterator() {
            return new IntIterator() {
                private int at;
                private boolean removed;

                public int value() {
                    if(removed) {
                        throw new IllegalStateException();
                    }
                    return get(at);
                }

                public boolean advance() {
                    at++;
                    removed = false;
                    return isValid();
                }

                public boolean isValid() {
                    return !removed && at < size();
                }

                public void remove() {
                    removeAt(at);
                    at--;
                    removed = true;
                }
            };
        }

    }

    static class IntArray extends IntAbstractStream implements IntList {
        private int[] data;

        public IntArray(int[] arr) {
            data = arr;
        }

        public int size() {
            return data.length;
        }

        public int get(int at) {
            return data[at];
        }

        public void removeAt(int index) {
            throw new UnsupportedOperationException();
        }

    }

    static interface IntIterator {
        public int value();

        public boolean advance();

        public boolean isValid();

    }
}

