#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <set>
#include <map>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

ll dp[111111];

//int constexpr MOD = 1e9+7;
int constexpr MOD = 1e9+9;

int main() {

  rep(i, 111111) dp[i] = 1;
  REP(i, 1, 10) REP(j, i, 111111) {
    (dp[j] += dp[j-i]) %= MOD;
  }

  int T;
  cin >> T;
  while(T--) {
    ll M; cin >> M; cout << dp[M/111111] << endl;
  }

  return 0;
}