#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>

using namespace std;

const long long modc = 1e9+9;

int main(){

    long long T, M, q;
    cin >> T;
    vector<vector<long long>> dp(10, vector<long long>(90001));
    vector<long long> S(90001);
    dp[0][0] = 1;
    for (int i=1; i<=9; i++){
        for (int j=0; j<=90000; j++){
            dp[i][j] = dp[i-1][j];
            if (j-i >= 0) dp[i][j] = (dp[i][j] + dp[i][j-i]) % modc;
        }
    }
    S[0] = 1;
    for (int i=1; i<=90000; i++){
        S[i] = (S[i-1] + dp[9][i]) % modc;
    }

    for (int i=0; i<T; i++){
        cin >> M;
        q = M / 111111;
        cout << S[q] << endl;
    }

    return 0;
}