#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i) = 0 ; (i) < (int)(n) ; (i)++)
#define REP(i,a,b) for(int (i) = a ; (int)(i) <= (int)(b) ; (i)++)
#define all(n) (n).begin(),(n).end()
typedef long long ll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<long long,long long> Pii;
typedef vector<Pii> VPii;

int C[] = {1,5,10,50,100,500};
int mod = 1e9 + 9;



int dp[6][10010];

int dfs(int x,int m){
	if( m < 0 ) return 0;
	if( x == 0 ) return 1;
	if( dp[x][m] != -1 ) return dp[x][m];
	int ans = dfs(x-1,m) + dfs(x,m-C[x]);
	return dp[x][m] = ans % mod; 
}

long long bpow(long long x,long long y){
	return y ? bpow(x*x%mod,y/2)*(y&1?x:1)%mod: 1;
}

int f(long long M){
	long long Q = M / 500 % mod;
	
	long long R = M % 500;
	vector<long long> X,Y;
	
	rep(x,10){
		X.push_back(x);
		Y.push_back(dfs(5,x*500+R));
	}
	
	long long ans = 0;
	for(int i = 0 ; i < 10 ; i++){
		long long A = 1;
		long long B = 1;
		for(int j = 0 ; j < 10 ; j++){
			if( i != j ) {
				(B *= X[i]-X[j]) %= mod;
				(A *=  Q  -X[j]) %= mod;
			}
		}
		( B += mod ) %= mod;
		( A += mod ) %= mod;
		ans += (A * bpow(B,mod-2))%mod * Y[i];
		ans %= mod;
	}
	return ans;
	
	
}

int main(){
	memset(dp,-1,sizeof(dp));
	int T;
	cin >> T;
	while(T--){
		long long M;
		cin >> M;
		cout << f(M) << endl;
	}

	
	
}