#include using namespace std; #define REP(x,y)for(ll x=0;x=0;--x) #define per(x,y,z)for(ll x=ll(z)-1;x>=ll(y);--x) #define all(v)begin(v),end(v) #define rall(v)rbegin(v),rend(v) #define pb emplace_back #define fi first #define se second #define lb(v,k)ll(lower_bound(all(v),k)-begin(v)) #define ub(v,k)ll(upper_bound(all(v),k)-begin(v)) #define uniq(v)sort(all(v)),v.erase(unique(all(v)),v.end()) #define sz(x)ll(x.size()) #define out(x)cout<<(x)<<'\n' #define sor(v)sort(all(v)) using ll=long long; using P=pair; using PP=tuple; using PPP=tuple; using vi=vector; using vvi=vector; using vb=vector; using vvb=vector; using vp=vector

; using vvp=vector; struct $_${$_$(){ios::sync_with_stdio(false);cin.tie(nullptr);}}$_$_$; templateinline bool chmin(T&A,T B){if(A>B){A=B;return true;}return false;} templateinline bool chmax(T&A,T B){if(A>T; vi dp(100000); dp[0]=1; rep(i,1,10)REP(j,100000-i)(dp[i+j]+=dp[j])%=MO; vi sum(100001); REP(i,100000)sum[i+1]=(sum[i]+dp[i])%MO; while(T--) { ll M; cin>>M; out(sum[M/111111+1]); } }