#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1000000009;
inline void add(ll &x,ll y) { x+=y; if (x>=mod) x-=mod; }
ll dp[100501];
ll rev(ll a) {
	ll r=1, n=mod-2;
	while(n) {
		if (n&1) r=r*a%mod;
		a=a*a%mod,n>>=1;
	}
	return r;
}
ll solve(ll x) {
	ll q=x/500,r=x%500,ret=0;	
	for (int i=0;i<=6;++i) {
		ll a=1,b=1;
		for (int j=0;j<=6;++j)
			if (i!=j) a=a*(mod-(q-j)%mod)%mod;
		for (int j=0;j<=6;++j)
			if (i!=j) b=b*(mod-(i-j))%mod;
		add(ret,dp[r+i*500]*a%mod*rev(b));
	}	
	return ret%mod;
}
int main() {
	int a[10]={0,1,5,10,50,100,500};
	dp[0]=1;
	for (int i=1;i<=6;++i)
		for (int j=a[i];j<=100000;++j)
			add(dp[j],dp[j-a[i]]);
	int T; ll x;
	cin>>T;
	while (T--) cin>>x,cout<<solve(x)<<endl;
}