#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e6+3;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
vector<int>fact;
int cho(int n,int r){
return di(fact[n],mul(fact[n-r],fact[r],M),M);
}
void solve(int testcase_number){
cin>>n>>k;
input(int,l,n-k+1);
if(l.size() == 1){
cout<<cho(k,l[0])<<endl;
}
else{
cout<<cho(k-1,min(l[0],l[1]))<<endl;
// if(l[0] <= l[1]){
// cout<<cho(k-1,l[0])<<endl;
// }
// else{
// cout<<cho(k-1,l[0]-1)<<endl;
// }
}
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
fact.resize(1e6+12,0);
fact[0] = 1;
for(int i = 1;i<=1e6+10;i++){
fact[i] = fact[i-1]*i;
fact[i]%=M;
}
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
