INCVN

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 2005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;
const int mod = 5000000;

int n, f[10005][55];
int a[10005];
int bit[10005][55];
int k;

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> k;
    for(int i=1; i<=n; i++) cin >> a[i];
    if (k > n){
        cout << 0;
        exit(0);
    }
}

void up(int i, int x, int k)
{
    for(; i <= 10000; i += i & -i) bit[i][k] = (bit[i][k] + x)%mod;
}

int getsum(int x, int k)
{
    int ans = 0;
    for(; x > 0; x -= x & -x) ans += bit[x][k];
    return ans%mod;
}

void compress()
{
    set<int> s(a+1,a+1+n);
    vector<int> b(s.begin(),s.end());
    for(int i=1; i<=n; i++)
    {
        int k = lower_bound(b.begin(),b.end(),a[i])-b.begin();
        a[i] = k+1;
    }
}

void proc()
{
    compress();
    for(int i=1; i<=n; i++)
        for(int l=1; l<=k; l++)
            if (l==1)
            {
                f[i][l]=1;
                up(a[i],f[i][l],l);
            }
            else{
                (f[i][l] += getsum(a[i]-1,l-1))%=mod;
                up(a[i],f[i][l],l);
            }
    int res=0;
    for(int i=k; i<=n; i++) res = (res + f[i][k])%mod;
    cout << res;
}

signed main()
{
    readfile();
    proc();
    return 0;
}