#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000009
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

int t,m;
ll dp[100100]={0};

int main(){
    
    scanf("%d",&t);
    
    for(int i=0;i<=100000;i++)
        dp[i]=1;
    
    for(int i=1;i<=9;i++){
        for(int j=0;j<=100000;j++){
            dp[j+i]=(dp[j+i]+dp[j])%mod;
        }
    }
    
    for(int i=0;i<t;i++){
        scanf("%d",&m);
        
        m/=111111;
        
        printf("%lld\n",dp[m]);
        
        
    }
    
    cerr << dp[2] << endl;
    
    return 0;
}