#include<cstdio>
#include<vector>


using namespace std;

using ll=long long;


vector<vector<int> > dp;


ll mod(ll x)
{
	return x%1000000009;
}


int min(int a, int b)
{
	if(a<b) return a;
	return b;
}


int solve(int md, int d)
{
	int i, imax;
	ll ret=0;

	if(d==0) return 1;
	if(dp[md][d]>=0) return dp[md][d];

	imax=md/d;
	for(i=0;i<=imax;i++)
	{
		ret+=solve(md-i*d, d-1);
	}
	return dp[md][d]=mod(ret);
}


int main(void)
{
	int t;

	dp.resize(90001);
	for(int i=dp.size()-1;i>=0;i--) dp[i].resize(10, -1);

	scanf("%d", &t);
	for(int i=0;i<t;i++)
	{
		ll m;

		scanf("%lld", &m);
		printf("%d\n", solve(m/111111, 9));
	}

	return 0;
}