#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+9;
int main()
{
	ll dp[100000]={};
	dp[0]=1;
	for(int i=1; i<=9; i++){
		for(int j=0; j<100000-i; j++){
			dp[j+i]+=dp[j];
			dp[j+i]%=MOD;
		}
	}
	ll s[100000]; s[0]=1;
	for(int i=1; i<100000; i++) s[i]=(s[i-1]+dp[i])%MOD;
	int t; cin>>t;
	for(int i=0; i<t; i++){
		ll m; cin>>m;
		cout<<s[m/111111]<<endl;
	}
	return 0;
}