#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 9;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
const int key = 3001;
ll dp[key];
vector<int> v = { 1,5,10,50,100,500 };
ll mod_inverse(ll x) {
	ll res = 1; ll n = mod - 2;
	while (n) {
		if (n % 2)(res *= x)%=mod;
		(x *= x) %= mod;
		n >>= 1;
	}
	return res;
}
int main() {
	dp[0] = 1;
	rep(i, 6) {
		rep(j, key) {
			if (j+v[i] < key) {
				(dp[j + v[i]] += dp[j]) %= mod;
			}
		}
	}
	int t; cin >> t;
	rep(aa, t) {
		ll m; cin >> m;
		if (m < key) {
			cout << dp[m] << endl; continue;
		}
		ll out = 0;
		ll d = m / 500; ll r = m % 500; d %= mod;
		rep(i, 6) {
			ll tmp = 1;
			rep(j, 6) {
				if (i == j)continue;
				(tmp *= d - j) %= mod;
				(tmp *= mod_inverse(i - j)) %= mod;
			}
			(tmp *= dp[i * 500 + r]) %= mod;
			(out += tmp) %= mod;
		}
		cout << (out+mod)%mod << endl;
	}
	return 0;
}