#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e4+5,M=(1<<20)+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
char s[N];int n;
ll f[N][7][7][7],g[N][8][8][8];int pw[7][N];
void add(ll &x,ll y){(x+=y)>=mod&&(x-=mod);}
void Solve(){
	int i,j;scanf("%s",s+1);n=strlen(s+1);
	reverse(s+1,s+n+1);for(i=1;i<=n;i++) s[i]-='0';s[n+1]=0;
	s[1]++;for(i=1;i<=n;i++) if(s[i]>=2) s[i]-=2,s[i+1]++;if(s[n+1]) n++;
	for(int i=1;i<=6;i++){
		pw[i][0]=1;for(int j=1;j<=n;j++) pw[i][j]=pw[i][j-1]*i%7;
	}
	Me(f,0);Me(g,0);
	f[0][0][0][0]=1;g[0][0][0][0]=1;
	for(i=1;i<=n;i++){
		if(i&1) Mc(g[i],g[i-1]);else Mc(f[i],f[i-1]);
		for(int x=0;x<7;x++) for(int y=0;y<7;y++) for(int z=0;z<7;z++)for(int o=(i==1);o<=1;o++){
			if(i&1){
				add(f[i][(x+o*pw[1][i-1])%7][(y+o*pw[2][i-1])%7][(z+o*pw[3][i-1])%7],f[i-1][x][y][z]);
			}else{
				add(g[i][(x+o*pw[1][i-1])%7][(y+o*pw[2][i-1])%7][(z+o*pw[3][i-1])%7],g[i-1][x][y][z]);
			}
		}
	}
	int sx=0,tx=0,sy=0,ty=0,sz=0,tz=0;ll ans=0;
	for(int i=n;i>1;i--)if(s[i]==1){
		for(int px=0;px<7;px++) for(int py=0;py<7;py++) for(int pz=0;pz<7;pz++){
			for(int qx=0;qx<7;qx++) if((px+sx+qx+tx)%7&&(px+sx-qx-tx)%7){
				for(int qy=0;qy<7;qy++) if((py+sy+qy+ty)%7&&(py+sy-qy-ty)%7){
					for(int qz=0;qz<7;qz++) if((pz+sz+qz+tz)%7&&(pz+sz-qz-tz)%7){
						ans+=f[i-1][px][py][pz]*g[i-1][qx][qy][qz]%mod;
					}
				}
			}
		}
		if(i&1) sx+=pw[1][i-1],sy+=pw[2][i-1],sz+=pw[3][i-1];
		else tx+=pw[1][i-1],ty+=pw[2][i-1],tz+=pw[3][i-1];
	}
	printf("%lld\n",ans%mod);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}