#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define int long long
const int N = 1e6 + 5, M = 1e6 + 3, LG = 20;
int n , k , A[N] , F[N];
int pw(int a , int b){
a%=M;
if (a == 0) return 0;
if (a == 1 || b == 0) return 1;
int p = pw(a,b/2);
if (b&1){
return ((p*p)%M * a)%M;
}else{
return (p*p)%M;
}
}
int C(int n , int r){
if (r > n) return 0;
return (F[n] * (pw((F[r] * F[n-r])%M , M - 2)))%M;
}
void solve(){
cin >> n >> k;
for (int i=0 ; i<(n-k+1) ; i++) cin >> A[i];
bool t[k+1] = {} , h[k+1] = {};
int o = A[0] , s = k;
for (int i=1 ; i<(n-k+1) ; i++){
// cout << i << endl;
if (A[i] == A[i-1]) continue;
if (A[i] < A[i-1]){
t[i%k] = 1;
if (!h[i%k]){
h[i%k] = 1;
s--;
}
}else{
if (!h[i%k]){
h[i%k] = 1;
s--;
}
}
}
for (int i=0 ; i<k ; i++){
o -= t[i];
}
// cout << s << ' ' << o << endl;
cout << C(s,o) << endl;
}
signed main(){
F[0] = 1;
for (int i=1 ; i<N ; i++) F[i] = (F[i-1]*i)%M;
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ts = 1;
// cin >> ts;
while(ts--){
solve();
}
}
