#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MOD = 1e9 + 7 ;
const int MAXN = 57 ;

int n ;
string a ;
ll ans ;
int freq[ 10 ] ;
ll comb[ MAXN ][ MAXN ] ;
int rem ;
ll precalc[ MAXN ] ;

int lim[ 10 ] ;
ll dp[ 11 ][ MAXN ] ;

void do_dp ( int rem ) {
    for ( int i = 0 ; i <= 10 ; ++ i ) {
        for ( int j = 0 ; j <= rem ; ++ j ) {
            dp[ i ][ j ] = 0 ;
        }
    }
    dp[ 0 ][ 0 ] = 1 ;
    for ( int i = 0 ; i < 10 ; ++ i ) {
        for ( int j = 0 ; j <= rem ; ++ j ) {
            for ( int t = 0 ; t <= min ( rem - j , lim[ i ] ) ; ++ t ) {
                dp[ i + 1 ][ j + t ] = ( dp[ i + 1 ][ j + t ] + dp[ i ][ j ] * comb[ rem - j ][ t ] ) % MOD ;
            }
        }
    }
}

ll proc ( int len , int rem , int spec ) {
    int cnt = 0 ;
    for ( int i = 0 ; i < 10 ; ++ i ) {
        cnt = max ( cnt , freq[ i ] ) ;
    }
    cnt = max ( cnt , ( len + 9 ) / 10 ) ;
    ll ret = 0 ;
    for ( int targ = cnt ; targ <= freq[ spec ] + rem ; ++ targ ) {
        ll add = comb[ rem ][ targ - freq[ spec ] ] ;
        bool bad = false ;
        for ( int i = 0 ; i < 10 ; ++ i ) {
            if ( i == spec ) { lim[ i ] = 0 ; }
            else if ( i < spec ) { lim[ i ] = targ - freq[ i ] ; }
            else { lim[ i ] = targ - freq[ i ] - 1 ; }
            if ( lim[ i ] < 0 ) { bad = true ; }
        }
        if ( bad == true ) { continue ; }
        do_dp ( rem - ( targ - freq[ spec ] ) ) ;
        add = ( add * dp[ 10 ][ rem - ( targ - freq[ spec ] ) ] ) % MOD ;
        ret = ( ret + add ) % MOD ;
    }
    return ret ;
}

void calc ( int spec ) {
    for ( int i = 0 ; i < 10 ; ++ i ) { freq[ i ] = 0 ; }
    for ( int eq = 0 ; eq < n ; ++ eq ) {
        for ( int nxt = 0 ; nxt < a[ eq ] - '0' ; ++ nxt ) {
            if ( nxt == 0 && eq == 0 ) { continue ; }
            ++ freq[ nxt ] ;
            ans = ( ans + proc ( n , n - eq - 1 , spec ) * spec ) % MOD ;
            -- freq[ nxt ] ;
        }
        ++ freq[ ( a[ eq ] - '0' ) ] ;
    }
}


void solve ( ) {
    cin >> a ;
    n = a.size ( ) ;
    ans = 0 ;
    map < int , int > cnt ;
    for ( int i = 0 ; i < n ; ++ i ) {
        ++ cnt[ ( a[ i ] - '0' ) ] ;
    }
    int mx = 0 ;
    for ( auto [ x , hh ] : cnt ) {
        if ( mx <= hh ) { mx = hh ; ans = x ; }
    }
    for ( int spec = 1 ; spec <= 9 ; ++ spec ) {
        calc ( spec ) ;
    }
    for ( int i = 1 ; i < n ; ++ i ) {
        ans += precalc[ i ] ;
    }
    cout << ans << "\n" ;
}

void init ( ) {
    comb[ 0 ][ 0 ] = 1 ;
    for ( int i = 1 ; i < MAXN ; ++ i ) {
        for ( int j = 0 ; j < MAXN ; ++ j ) {
            comb[ i ][ j ] = comb[ i - 1 ][ j ] ;
            if ( j > 0 ) {
                comb[ i ][ j ] = ( comb[ i ][ j ] + comb[ i - 1 ][ j - 1 ] ) % MOD ;
            }
        }
    }
    for ( int i = 1 ; i <= 50 ; ++ i ) {
        for ( int fst = 1 ; fst <= 9 ; ++ fst ) {
            ++ freq[ fst ] ;
            for ( int spec = 0 ; spec <= 9 ; ++ spec ) {
                precalc[ i ] = ( precalc[ i ] + proc ( i , i - 1 , spec ) * spec ) % MOD ;
            }
            -- freq[ fst ] ;
        }
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    init ( ) ;
    int t = 1 ; cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}