#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;
// -------------------------------------

#define MAX 100000

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

void Main() {
  REP(j, MAX+1) dp[0][j]=1;

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

  int T;
  cin >> T;
  REP(i, T) {
    ll m;
    cin >> m;
    ll x = m / 111111;
    cout << dp[9][x] << endl;
  }
}

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