// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 9;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

#define NB 90001
ll dp[10][NB], sum[NB];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  dp[0][0] = 1;
  for(int i = 0; i < 9; i++){
    for(int j = 0; j < NB; j++){
      dp[i+1][j] = dp[i][j];
      if(j - i - 1 >= 0){
        dp[i+1][j] = (dp[i+1][j] + dp[i+1][j-i-1]) % mod;
      }
    }
  }
  for(int j = 0; j < NB; j++){
    sum[j] = dp[9][j];
    if(j > 0)sum[j] = (sum[j] + sum[j-1]) % mod;
  }

  int t;
  cin >> t;
  rep(i_, t){
    ll m;
    cin >> m;
    ll res = 0;
    res = (res + sum[m / 111111]) % mod;
    cout << res << endl;
  }
	return 0;
}