#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

const int mod = 1000000000 + 9;

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

    VI dp(100001);
    dp[0] = 1;
    for(int i=1;i<=9;i++){
        FOR(j,SZ(dp) - i){
            dp[j + i] += dp[j];
            if(dp[j + i] >= mod) dp[j + i] -= mod;
        }
    }
    for(int i=1;i<SZ(dp);i++){
        dp[i] += dp[i-1];
        dp[i] %= mod;
    }

    while(t--){
        long long m;
        scanf("%lld", &m);
        long long n111111 = m / 111111;
        cout<<dp[n111111]<<endl;
    }
    return 0;
}