#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

typedef long long ll;

#define FOR(i, s, e) for (int i = (s); i <= (e); i++)

#define MOD(N) ((N) % 1000000009)


ll T;

ll M;

ll dp[10][90010];

int main()
{
    cin >> T;

    FOR(c,0,T - 1)
    {
        cin >> M;

        int N  = M / 111111;

        FOR(i,0,9)
        {
            FOR(j,0,9009)
            {
                dp[i][j] = 0;
            }
        }
        dp[0][0] = 1;

        FOR(i,1,9)
        {
            FOR(j,0,N)
            {
                if(j - i >= 0)
                {
                    dp[i][j] += dp[i - 1][j] + dp[i][j - i];
                }
                else
                {
                    dp[i][j] += dp[i - 1][j];
                }
                dp[i][j] = MOD(dp[i][j]);
            }
        }
        ll result = 0;
        FOR(i,0,N)
        {
            result = MOD(result + dp[9][i]);
        }

        cout << result << endl;
    }
}