#include using namespace std; using ll = long long; using vi = vector; using vb = vector; using vd = vector; using vl = vector; using vvi = vector; using vvb = vector; using vvd = vector; using vvl = vector; #define REP(i,n) for(ll i=0; i<(n); ++i) #define FOR(i,b,n) for(ll i=(b); i<(n); ++i) #define TEN(x) ((ll)1e##x) #define MOD (TEN(9) + 9) int main() { vvl dp(10, vl(TEN(10)/111111 + 1, 0)); // dp[10][TEN(10)/111111 + 1] dp[0][0] = 1; FOR(i, 1, dp.size()) REP(j, dp[0].size()) { dp[i][j] += dp[i-1][j]; if(j-i>=0) (dp[i][j] += dp[i][j-i]) %= MOD; } ll t; cin >> t; REP(_, t) { ll m; cin >> m; ll sum = 0; REP(i, m / 111111 + 1) (sum += dp.back()[i]) %= MOD; cout << sum << endl; } return 0; }