#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))

int MOD = 1000000009;
int dp[100000];

int main(){
    int T;
    cin >> T;

    REP(i,100000) dp[i] = 1;
    for(int i = 1; i < 10; i++){
        for(int j = i; j < 100000; j++){
            dp[j] = (dp[j] + dp[j-i]) % MOD;
        }
    }

    REP(i,T){
        ll N;
        cin >> N;
        cout << dp[N/111111] << endl;
    }
    return 0;
}