#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e6+10,mod=1e6+3;
int n,k,cnt;
int sum[N];
int s[N];
int ans;
void dfs(int x){
	if(x>n){
		ans=(ans+1)%mod;
		return;
	}
	int l,r,num;
	s[x]=s[x-1];
	if(x>=k){
		l=x-k+1;
		r=l+k-1;
		num=s[r]-s[l-1];
		if(num==sum[l]) dfs(x+1);
	}
	else dfs(x+1);
	s[x]++;
	if(x>=k){
		l=x-k+1;
		r=l+k-1;
		num=s[r]-s[l-1];
		if(num==sum[l]) dfs(x+1);
	}
	else dfs(x+1);
	return;
}
int main(){
	freopen("Binaria.in","r",stdin);
	freopen("Binaria.out","w",stdout);
	scanf("%d%d",&n,&k);
	cnt=n-k+1;
	for(int i=1;i<=cnt;i++) scanf("%d",&sum[i]);
	dfs(1);
	printf("%d",ans);
	return 0;
}