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

typedef long long ll;
typedef pair< int, int > pii;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef vector< pii > vp;
typedef vector< vp > vvp;
typedef vector< string > vs;
typedef vector< double > vd;
typedef vector< vd > vvd;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;
const int MOD9 = 1e9 + 9;

int T;
vl M;

void init(){
  cin >> T;
  M = vl( T );
  for( int i = 0; i < T; ++i )
    cin >> M[ i ];
}

ll maxm;
vl dp;

void preprocess(){
  maxm = *max_element( M.begin(), M.end() );
  dp = vl( maxm / 111111 + 1 );
  dp[ 0 ] = 1;
  for( int i = 1; i <= 9; ++i )
    for( int j = 0; j + i < dp.size(); ++j )
      if( j + i < dp.size() )
        ( dp[ j + i ] += dp[ j ] ) %= MOD9;
  for( int i = 1; i < dp.size(); ++i )
    ( dp[ i ] += dp[ i - 1 ] ) %= MOD9;
}

void solve(){
  for( int i = 0; i < T; ++i )
    cout << dp[ M[ i ] / 111111 ] << endl;
}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}