import java.util.*;
import java.math.*;
public class Main {
    public static void main(String[] args) {
        Scanner cin=new Scanner(System.in);
        BigInteger [][] f = new BigInteger [300][300];
        int n,k;
        int [] a = new int [300];
        while(cin.hasNext())
        {
            for (int i=0;i<200;i++)
                for (int j=0;j<200;j++)
                    f[i][j]=BigInteger.ZERO;
            for (int i=0;i<=200;i++) f[i][1]=BigInteger.ONE;
            n=cin.nextInt();
            k=cin.nextInt();
            for (int i=1;i<=n;i++) a[i]=cin.nextInt();
            for (int i=1;i<=n;i++)
            {
                for (int j=1;j<i;j++)
                {
                    if (a[i] > a[j])
                    {
                        for (int l=2;l<=n;l++)
                        {
                            f[i][l]=f[i][l].add(f[j][l-1]);
                        }
                    }
                }
            }
            BigInteger ans;
            ans=BigInteger.ZERO;
            for (int i=1;i<=n;i++)
                ans=ans.add(f[i][k]);
            System.out.println(ans);
        }
        cin.close();
    }
}