#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <tuple>
#include <iomanip>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const ll mod = 1000000009;
const double eps = 1e-8;
ll dp[100000];

void calc() {
    dp[0] = 1;
    for (int j = 1; j <= 9; j++) {
	for (int i = 0; i < 100000; i++) {
	    if (i - j >= 0) {
		dp[i] = (dp[i] + dp[i-j]) % mod;
	    }
	}
    }
    for (int i = 1; i < 100000; i++) {
	dp[i] = (dp[i-1] + dp[i]) % mod;
    }
}

ll solve(ll m) {
    return dp[m/111111];
}

int main() {
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    */


    calc();

    int t;
    scanf("%d", &t);
    for (int i = 0; i < t; i++) {
	ll m;
	scanf("%lld", &m);
	printf("%lld\n", solve(m));
    }
}