#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod = 1e9 + ;

char s[];

int len;

map<ll, ll> mp;

ll getphi(ll o)

{

    if(mp[o]) return mp[o];

    ll res = o;

    ll n = o;

    for(ll i = ; i * i <= n; i++)

    {

        if(n % i == )

        {

            res -= res / i;

            while(n % i == ) n /= i;

        }

    }

    if(n > )  res -= res / n;

    mp[o] = res;

    return res;

}

ll pow_mod(ll x, ll y, ll mo)

{

    ll res = ;

    while(y)

    {

        if(y & ) res = res * x % mo;

        y >>= ;

        x = x * x % mo;

    }

    return res;

}

ll dfs(ll x, ll m)

{

    if(x < ) return ;

    if(m == ) return ;

    if(s[x] == '')

    {

        ll p = getphi(m);

        ll tmp = (dfs(x - , p) + p) % p;

        tmp = pow_mod(, tmp, m);

        return (6LL * tmp % m - 3LL + m) % m;

    }

    if(s[x] == '') return (dfs(x - , m) + 1LL) % m;

    if(s[x] == '') return (dfs(x - , m) * 2LL + 2LL) % m;

    return ;

}

int main()

{

    int T;

    scanf("%d", &T);

    while(T--)

    {

        scanf("%s", s);

        len = strlen(s);

        ll ans = dfs(len - , mod);

        printf("%lld\n", ans);

    }

    return ;

}