import sys

MOD = 10**9 + 9

def main():
    input = sys.stdin.read().split()
    T = int(input[0])
    cases = [int(input[i]) for i in range(1, T + 1)]
    
    max_k_candidate = 0
    for M in cases:
        current_k = M // 111111
        max_k_candidate = max(max_k_candidate, current_k)
    
    max_k = max_k_candidate
    dp = [0] * (max_k + 1)
    dp[0] = 1
    
    for i in range(1, 10):
        for k in range(i, max_k + 1):
            dp[k] = (dp[k] + dp[k - i]) % MOD
    
    # Compute prefix sum
    sum_dp = [0] * (max_k + 1)
    sum_dp[0] = dp[0]
    for k in range(1, max_k + 1):
        sum_dp[k] = (sum_dp[k - 1] + dp[k]) % MOD
    
    results = []
    for M in cases:
        k_candidate = M // 111111
        if 111111 * k_candidate > M:
            k_candidate -= 1
        k_max = k_candidate
        
        if k_max < 0:
            results.append(0)
        else:
            if k_max > max_k:
                results.append(0)
            else:
                results.append(sum_dp[k_max] % MOD)
    
    print("\n".join(map(str, results)))

if __name__ == '__main__':
    main()