#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

const ll mod = (ll)1e9 + 9;
const int ma = (int)2e5 + 10;
vector<ll> dp(ma, 1);
ll mod_pow(ll x, ll n) {
    ll ret = 1;
    while (n) {
        if (n & 1LL) (ret *= x) %= mod;
        n >>= 1;
        (x *= x) %= mod;
    }
    return ret;
}

void precalc() {
    vi cs = {5, 10, 50, 100, 500};
    for (auto c : cs) {
        REP(i, c, ma)(dp[i] += dp[i - c]) %= mod;
    }
}

void solve() {
    ll m;
    cin >> m;
    ll x = m / 500, y = m % 500;
    ll ans = 0;

    rep(i, 6) {
        ll a = 1, b = 1;
        rep(j, 6) if (i != j) {
            (a *= (mod - x % mod + j) % mod) %= mod;
        }
        rep(j, 6) if (i != j) {
            (b *= (mod - i + j) % mod) %= mod;
        }
        ans += dp[y + i * 500] * a % mod * mod_pow(b, mod - 2) % mod;
        ans %= mod;
    }

    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    precalc();
    cin >> t;
    rep(ti, t) solve();
    return 0;
}