#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;

bool done[100000][20];
ll dp[100000][20];

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

ll solve(ll k, int last){
    if(k == 0)return 1;
    if(last >= 10)return 0;
    
    if(done[k][last])return dp[k][last];
    
    ll res = 0;
    if(k >= coin[last]){
        res = solve(k - coin[last], last);
        res = (res + solve(k, last + 1)) % MOD;
    }
    
    
    done[k][last] = true;
    return dp[k][last] = res;
}

int main(){
    for(int k=0;k<100000;k++)for(int i=0;i<10;i++)solve(k, i);
    
    int T;
    cin >> T;
    
    while(T--){
        ll M;
        cin >> M;
        
        cout << solve(M / 111111, 0) << endl;
    }
    
    return 0;
}