#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using pii=pair<int,int>;
using vi=vector<int>;
using ll=long long;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

void ad(int&a,int b)
{
	a+=b;
	if (a>=MOD) a-=MOD;
}

int sub(int a,int b)
{
	if (a<b) return a-b+MOD;
	return a-b;
}

void su(int&a,int b)
{
	a-=b;
	if (a<0) a+=MOD;
}

int mul(int a,int b)
{
	return (a*1ll*b)%MOD;
}

int add7(int a,int b)
{
	if (a+b>=7) return a+b-7;
	return a+b;
}

int t,n,p7[10][10];
int dp1[10][10010][10];
int dp2[20][10010][55];
int dp3[25][10010][350];
int dp0[10010][10];
array<int,6> re[N]; //N>(1<<18)

string add1(string s)
{
	s="0"+s;
	++s.back();
	for (int cu=(int)s.size()-1;s[cu]=='2';--cu)
	{
		s[cu]='0';
		++s[cu-1];
	}
	int poc=0;
	while (s[poc]=='0') ++poc;
	return s.substr(poc);
}

int getAn(int dig,array<int,6> cu) //cu su koeficijenti polinoma
{
	int an=1;
	for (int i=0;i<6;++i)
	{
		int cn=dig/6+(dig%6>i);
		int re=dp0[cn][cu[i]];
		if (i==0) su(re,dp0[cn-1][cu[i]]);
		an=mul(an,re);
	}
	return an;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	for (int i=1;i<7;++i)
	{
		p7[i][0]=1;
		for (int j=0;j<7;++j) p7[i][j+1]=(p7[i][j]*i)%7;
	}
	dp0[0][0]=1;
	for (int i=0;i<=10005;++i) for (int p=0;p<7;++p)
	{
		ad(dp0[i+1][p],dp0[i][p]);
		ad(dp0[i+1][add7(p,1)],dp0[i][p]);
	}
	//zadnja znamenka je 1
	for (int b=0;b<(1<<18);++b)
	{
		array<int,6> ar;
		bool ok=1;
		for (int i=0;i<6;++i)
		{
			ar[i]=(b>>(3*i))&7;
			if (ar[i]==7) ok=0;
		}
		if (ok)
		{
			int ro=0;
			for (int r=1;r<7;++r)
			{
				int res=0;
				for (int i=5;i>=0;--i)
				{
					res=(res*r+ar[i])%7;
				}
				ro=ro*8+res;
			}
			re[ro]=ar;
		}
	}
	vector<vi> ievi;
	vi s1,s2,s3;
	for (int b=0;b<(1<<6);++b)
	{
		vi icu;
		for (int i=0;i<6;++i) if ((b>>i)&1) icu.pb(i);
		ievi.pb(icu);
		if (__builtin_popcount(b)==1)
		{
			int cu=s1.size();
			s1.pb(b);
			dp1[cu][1][1]=1;
			for (int i=1;i<=10005;++i) for (int pr=0;pr<7;++pr)
			{
				ad(dp1[cu][i+1][pr],dp1[cu][i][pr]);
				ad(dp1[cu][i+1][add7(pr,p7[cu+1][i%6])],dp1[cu][i][pr]);
			}
		}
		if (__builtin_popcount(b)==2)
		{
			int cu=s2.size();
			s2.pb(b);
			int x=ievi[b][0],y=ievi[b][1];
			dp2[cu][1][8]=1;
			for (int i=1;i<=10005;++i) for (int pr1=0;pr1<7;++pr1) for (int pr2=0;pr2<7;++pr2)
			{
				int cpr=pr1*7+pr2;
				int npr=add7(pr1,p7[x+1][i%6])*7+add7(pr2,p7[y+1][i%6]);
				ad(dp2[cu][i+1][cpr],dp2[cu][i][cpr]);
				ad(dp2[cu][i+1][npr],dp2[cu][i][cpr]);
			}
		}
		if (__builtin_popcount(b)==3)
		{
			int cu=s3.size();
			s3.pb(b);
			int x=ievi[b][0],y=ievi[b][1],z=ievi[b][2];
			dp3[cu][1][57]=1;
			for (int i=1;i<=10005;++i) for (int pr1=0;pr1<7;++pr1) for (int pr2=0;pr2<7;++pr2) for (int pr3=0;pr3<7;++pr3)
			{
				int cpr=pr1*49+pr2*7+pr3;
				int npr=add7(pr1,p7[x+1][i%6])*49+add7(pr2,p7[y+1][i%6])*7+add7(pr3,p7[z+1][i%6]);
				ad(dp3[cu][i+1][cpr],dp3[cu][i][cpr]);
				ad(dp3[cu][i+1][npr],dp3[cu][i][cpr]);
			}
		}
	}
	cin>>t;
	while (t--)
	{
		string s;
		cin>>s;
		s=add1(s);
		n=s.size();
		int an=0;
		for (int i=0;i<n-1;++i)
		{
			an=add(add(an,an),s[i]-'0');
		}
		int c1=0,c2=0,c3=0;
		for (int b=1;b<64;++b)
		{
			int can=0;
			if (__builtin_popcount(b)==1)
			{
				int x=ievi[b][0],cx=0;
				for (int i=0;i<n-1;++i) if (s[i]=='1')
				{
					ad(can,dp1[c1][n-i-1][(7-cx)%7]);
					cx=add7(cx,p7[x+1][(n-i-1)%6]);
				}
				++c1;
				su(an,can);
			}
			else if (__builtin_popcount(b)==2)
			{
				int x=ievi[b][0],y=ievi[b][1],cx=0,cy=0;
				for (int i=0;i<n-1;++i) if (s[i]=='1')
				{
					int cr=((7-cx)%7)*7+(7-cy)%7;
					ad(can,dp2[c2][n-i-1][cr]);
					cx=add7(cx,p7[x+1][(n-i-1)%6]);
					cy=add7(cy,p7[y+1][(n-i-1)%6]);
				}
				++c2;
				ad(an,can);
			}
			else if (__builtin_popcount(b)==3)
			{
				int x=ievi[b][0],y=ievi[b][1],z=ievi[b][2],cx=0,cy=0,cz=0;
				for (int i=0;i<n-1;++i) if (s[i]=='1')
				{
					int cr=((7-cx)%7)*49+((7-cy)%7)*7+(7-cz)%7;
					ad(can,dp3[c3][n-i-1][cr]);
					cx=add7(cx,p7[x+1][(n-i-1)%6]);
					cy=add7(cy,p7[y+1][(n-i-1)%6]);
					cz=add7(cz,p7[z+1][(n-i-1)%6]);
				}
				++c3;
				su(an,can);
			}
			else if (__builtin_popcount(b)==4)
			{
				int x=ievi[63-b][0],y=ievi[63-b][1];
				array<int,6> vals={0,0,0,0,0,0};
				for (int i=0;i<n-1;++i) if (s[i]=='1')
				{
					int cval=0;
					for (int j=0;j<6;++j)
					{
						cval*=8;
						if ((b>>j)&1) cval+=(7-vals[j])%7;
					}
					for (int vx=0;vx<7;++vx) for (int vy=0;vy<7;++vy)
					{
						int novval=cval+vx*(1<<(3*(5-x)))+vy*(1<<(3*(5-y)));
						//cout<<cval<<' '<<novval<<endl;
						/*if (getAn(n-i-1,re[novval]))
						{
							cout<<cval<<' '<<novval<<' '<<i<<' '<<n-i-1<<' '<<getAn(n-i-1,re[novval])<<en;
							for (auto x: re[novval]) cout<<x<<' ';
							cout<<en<<en;
						}*/
						ad(can,getAn(n-i-1,re[novval]));
					}
					for (int j=0;j<6;++j) if ((b>>j)&1) vals[j]=add7(vals[j],p7[j+1][(n-i-1)%6]);
				}
				ad(an,can);
			}
			else if (__builtin_popcount(b)==5)
			{
				int x=ievi[63-b][0];
				array<int,6> vals={0,0,0,0,0,0};
				for (int i=0;i<n-1;++i) if (s[i]=='1')
				{
					int cval=0;
					for (int j=0;j<6;++j)
					{
						cval*=8;
						if ((b>>j)&1) cval+=(7-vals[j])%7;
					}
					for (int vx=0;vx<7;++vx)
					{
						int novval=cval+vx*(1<<(3*(5-x)));
						ad(can,getAn(n-i-1,re[novval]));
					}
					for (int j=0;j<6;++j) if ((b>>j)&1) vals[j]=add7(vals[j],p7[j+1][(n-i-1)%6]);
				}
				su(an,can);
			}
			else
			{
				//popcount==6
				array<int,6> vals={0,0,0,0,0,0};
				for (int i=0;i<n-1;++i) if (s[i]=='1')
				{
					int cval=0;
					for (int j=0;j<6;++j)
					{
						cval*=8;
						cval+=(7-vals[j])%7;
					}
					ad(can,getAn(n-i-1,re[cval]));
					for (int j=0;j<6;++j) vals[j]=add7(vals[j],p7[j+1][(n-i-1)%6]);
				}
				ad(an,can);
			}
			//cout<<b<<' '<<can<<' '<<an<<endl;
		}
		cout<<an<<en;
	}
}