#include "bits/stdc++.h"
using namespace std;

typedef long long Int;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);++(i))

const Int MOD = 1e9 + 9;
const int N = 100000 + 10;
Int dp[N];

Int solve(int M) {
	if (dp[0] == 0) {
		int a[10] = {1, 1, 2, 3, 4, 5, 6, 7, 8, 9};
		dp[0] = 1;
		for (auto x: a) {
			for (int m = 0; m + x < N; m++) {
				dp[m + x] += dp[m];
				if (dp[m + x] >= MOD) dp[m + x] -= MOD;
			}
		}
	}
	return dp[M];
}

int main() {
	int T; cin >> T;
	REP(t, T) {
		Int M;
		cin >> M;
		cout << solve((int)(M / 111111)) << endl;
	}
}