#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 100000000
#define MOD 1000000009

typedef long long ll;

int dp[10][1000000];

int main() {
    int i, j, t;
    cin >> t;
    fill(dp[0],dp[0]+1000000,1);
    REP (i,1,10) {
        rep (j,1000000) {
            dp[i][j] = dp[i-1][j] + (i <= j ? dp[i][j-i] : 0);
            dp[i][j] %= MOD;
        }
    }
    rep (i,t) {
        ll m;
        cin >> m;
        cout << dp[9][m/111111] << endl;
    }
    return 0;
}