#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

const ll MOD = 1e9 + 9;
const int MAX = 100000;

int main() {
  // ios_base::sync_with_stdio(false);
  vector<ll> dp(MAX + 1, 1);
  REP(i, 1, 9 + 1) {
    dp[i]++;
    REP(j, 1, MAX + 1) {
      if(i + j > MAX) continue;
      dp[i + j] += dp[j];
      dp[i + j] %= MOD;
    }
  }

  int T;
  cin >> T;
  rep(i, T) {
    ll M;
    cin >> M;
    cout << dp[M / 111111] << endl;
  }
  return 0;
}