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

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FORR(x,arr) for(auto&& x:arr)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
typedef long long ll;
// -------------------------------------

constexpr int MAX = 10000000000L / 111111 + 1;

const int mod = 1000000009;
int dp[MAX];

void Main() {
  dp[0] = 1;
  FOR(j, 1, 10) REP(i, MAX-j) {
    dp[i+j] += dp[i];
    if (dp[i+j] > mod) dp[i+j]-=mod;
  }
  FOR(i, 1, MAX) {
    dp[i] += dp[i-1];
    if (dp[i] > mod) dp[i]-=mod;
  }

  int T;
  scanf("%d", &T);
  REP(i, T) {
    ll m;
    scanf("%lld", &m);
    _P("%d\n", dp[m / 111111]);
  }
}

int main() {Main(); return 0; }