#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <fstream>
#include <sstream>
using namespace std;
typedef long long ll;

const ll MOD = 1000000009ll;
int coin[] = {1, 1, 2, 3, 4, 5, 6, 7, 8, 9};

ll dp[100000][20];
ll solve(ll K){
    memset(dp, 0, sizeof(dp));
    
    dp[0][0] = 1;
    
    for(int k=0;k<K;k++){
        for(int last=0;last<10;last++){
            int add = coin[last];
            dp[k+add][last] = (dp[k+add][last] + dp[k][last]) % MOD;
            dp[k][last+1] = (dp[k][last+1] + dp[k][last]) % MOD;
        }
    }
    
    ll res = 0;
    for(int i=0;i<10;i++)res = (res + dp[K][i]) % MOD;
    return res;
}

int main(){
    ifstream cin("/Users/user/Desktop/yukicoder/41/input.txt");
    
    int T;
    cin >> T;
    
    while(T--){
        ll M;
        cin >> M;
        
        cout << solve(M / 111111) << endl;
    }
    
    return 0;
}