import java.io.*;
import java.util.*;
import java.math.BigInteger;

class Main {
    Reader in;
    PrintWriter out;
    public static void main(String[] args) {
        new Main().solve();
    }
    void solve() {
    in = new Reader(System.in);
    out = new PrintWriter(System.out);

    int N, K;
    String tmp;
    while ((tmp = in.next()) != null) {
        N = Integer.parseInt(tmp);
        K = in.nextInt();
        int[] A = new int[N];
        
        for (int i=0; i<N; i++) {
        A[i] = in.nextInt();
        }

        BigInteger[][] dp = new BigInteger[N+1][N+5];
        BigInteger ans = BigInteger.ZERO;
        
        for (int i=0; i<N+1; i++)
        for (int j=0; j<N+5; j++)
            dp[i][j] = BigInteger.ZERO;

        for (int i=0; i<N; i++) {
        dp[i][1] = BigInteger.ONE;
        for (int j=0; j<i; j++) {
            if (A[j] < A[i]) {
            for (int k=1; k<=j+1; k++) {
                dp[i][k+1] = dp[i][k+1].add(dp[j][k]);
            }
            }
        }
        }

        for (int i=0; i<N; i++) ans = ans.add(dp[i][K]);

        out.println( ans.toString() );
        out.flush();
    }
    }
}

class Reader {
    BufferedReader br;
    StringTokenizer st;
    Reader(InputStream is) {
        br = new BufferedReader(new InputStreamReader(is));
        st = null;
    }
    String next() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
        return null;
                // e.printStackTrace();
            }
        }
        return st.nextToken();
    }
    int nextInt() {
        return Integer.parseInt(next());
    }
}