#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);
vector<ll> ep(ma);
void precalc() {
    dp[0] = 1;
    for (int j = 1; j < 10; ++j) {
        rep(i, ma) if (i + j < ma) {
            (dp[j + i] += dp[i]) %= mod;
        }
    }
    ep[0] = dp[0];
    REP(i, 1, ma) {
        ep[i] = (ep[i - 1] + dp[i]) % mod;
    }
}

void solve() {
    ll m;
    cin >> m;
    ll x = m / 111111;
    ll ans = ep[x];
    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;
}