#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

ll dp[112345][11];
ll mod = 1000000009;

int main() {
	dp[0][1] = 1;
	REP(i, 110000) FOR(j, 1, 10) {
		if (dp[i][j] == 0) continue;
		
		FOR(k, j, 10) (dp[i + k][k] += dp[i][j]) %= mod;
	}
	
	REP(i, 110000) FOR(j, 1, 10) (dp[i + 1][j] += dp[i][j]) %= mod;
	
	
	int t; cin >> t;
	
	while (t--) {
		ll m; cin >> m;
		
		m /= 111111;
		
		ll ans = 0;
		REP(i, 10) ans += dp[m][i];
		
		ans %= mod;
		
		cout << ans << endl;
	}
	return 0;
}