#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 9;

ll dp[10][1000000];

void init() {
	dp[0][0] = 1;	

	rep2 (i, 1, 10) {
		rep (j, 1000000) {
			dp[i][j] += dp[i - 1][j];
			dp[i][j] %= mod;
			if (j - i >= 0) {
				dp[i][j] += dp[i][j - i];
				dp[i][j] %= mod;
			}
		}
	}

	rep (i, 1000000 - 1) {
		(dp[9][i + 1] += dp[9][i]) %= mod;
	}
}

int main() {
	init();
	int T;
	cin >> T;

	while (T--) {
		ll M;
		cin >> M;
		M /= 111111;
		ll ans = dp[9][M];
		cout << ans << endl;
	}

	return 0;
}