#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>
 
#define F1(x,y,z) for(int x=y;x<z;x++)
#define F2(x,y,z) for(int x=y;x<=z;x++)
#define F3(x,y,z) for(int x=y;x>z;x--)
#define F4(x,y,z) for(int x=y;x>=z;x--)
#define pb push_back
#define LL long long
#define co complex<double>
 
#define MAX 100005
#define AMAX 1500
#define MOD 1000000007

#define f(c,d) ((1<<(c))*(d))

using namespace std;

int n,k,x[MAX],ta;
vector<int> dp[105][105],ans;

vector<int> add(vector<int>& a,vector<int>& b){
    vector<int> t;
    ta=0;
    F1(c,0,max(a.size(),b.size())){
        if(c<a.size())ta+=a[c];
        if(c<b.size())ta+=b[c];
        t.pb(ta%1000000000);
        ta/=1000000000;
    }
    while(ta){
        t.pb(ta%1000000000);
        ta/=1000000000;
    }
    return t;
}

bool hv(vector<int>& a){
    return a.size()>1||a[0]!=0;
}

int main(){
    while(scanf("%d%d",&n,&k)==2){
        F1(a,0,n)scanf("%d",&x[a]);
        F1(a,0,n){
            F1(b,0,105){
                dp[a][b].clear();
                dp[a][b].pb(0);
            }
            dp[a][1][0]=1;
            F1(b,0,a)if(x[b]<x[a])F1(c,1,100)if(hv(dp[a][c+1])||hv(dp[b][c]))dp[a][c+1]=add(dp[a][c+1],dp[b][c]);
        }
        ans.clear();
        ans.pb(0);
        F1(a,0,n)ans=add(ans,dp[a][k]);
        printf("%d",ans.back());
        F4(a,((int)ans.size())-2,0)printf("%09d",ans[a]);
        printf("\n");
    }
    //system("pause");
    return 0;
}