#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000009LL;

int T, M;
int dp[10][100010];

signed main() {
    dp[0][0] = 1;
    repq(i,1,9) rep(j,0,100010) {
        dp[i][j] = dp[i-1][j];
        if(j-i<0) continue;
        (dp[i][j] += dp[i][j-i]) %= MOD;
    }
    rep(j,1,100010) (dp[9][j] += dp[9][j-1]) %= MOD;

    cin >> T;
    rep(cases,0,T) {
        cin >> M; M /= 111111;
        // printf("M = %lld\n", M);
        cout << dp[9][M] << endl;
    }
    return 0;
}