// 抄袭的 xtqqwq
#include <bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long LL;
typedef pair<int, int> pii;
typedef vector<int> vi;

template <typename T> bool chkmax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkmin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int P = 1e9 + 7, N = 4e3 + 5, M = 1e5 + 5;
int n, ncnt;
int trans[N][10][10];
LL d[N], f[N];
char s[M];
bool can[N];
map<pair<vi, vi>, int> dfn;
pair<vi, vi> rnk[N];
pii pl[10] = {mp(0, 0), mp(1, 1), mp(1, 2), mp(1, 3), mp(2, 1), mp(2, 2), mp(2, 3), mp(3, 1), mp(3, 2), mp(3, 3)};

bool check4(int a1, int a2, int a3, int a4, int b1, int b2, int b3, int b4) {
    if (a1 == a2 || a1 == a3 || a1 == a4 || a2 == a3 || a2 == a4 || a3 == a4) return false;
    if (b1 == b2 || b1 == b3 || b1 == b4 || b2 == b3 || b2 == b4 || b3 == b4) return false;
    vi t = {a1, a2, a3, a4, b1, b2, b3, b4};
    int mina[2] = {3, 3}, maxa[2] = {1, 1};
    for (auto r : t) {
        chkmin(mina[0], pl[r].fi), chkmax(maxa[0], pl[r].fi);
        chkmin(mina[1], pl[r].se), chkmax(maxa[1], pl[r].se);
    }
    return maxa[0] - mina[0] <= 1 && maxa[1] - mina[1] <= 1;
}

bool check2(int a1, int a2, int b1, int b2) {
    if (a1 == a2 || b1 == b2) return false;
    vi t = {a1, a2, b1, b2};
    int mina[2] = {3, 3}, maxa[2] = {1, 1};
    for (auto r : t) {
        chkmin(mina[0], pl[r].fi), chkmax(maxa[0], pl[r].fi);
        chkmin(mina[1], pl[r].se), chkmax(maxa[1], pl[r].se);
    }
    return maxa[0] - mina[0] + maxa[1] - mina[1] == 1;
}

void dfs(pair<vi, vi> u) {
    dfn[u] = ++ncnt;
    rnk[ncnt] = u;
    int lab = ncnt;
    for (int i = 1; i <= 9; i++) {
        for (int j = 1; j <= 9; j++) {
            if (abs(pl[i].fi - pl[j].fi) > 1 || abs(pl[i].se - pl[j].se) > 1) continue;
            auto now = u;
            now.fi.pb(i), now.se.pb(j);
            if (now.fi.size() == 6) {
                if (!check4(now.fi[3], now.fi[4], i, j, now.se[3], now.se[4], j, i) && !check4(now.fi[2], now.fi[3], now.fi[4], i, now.se[2], now.se[3], now.se[4], j)) {
                    if (abs(pl[now.fi[2]].fi - pl[now.fi[3]].fi) == 1 && abs(pl[now.fi[2]].se - pl[now.fi[3]].se) == 1) {
                        now.fi = vi{now.fi[4], now.fi[5]};
                        now.se = vi{now.se[4], now.se[5]};
                    } else {
                        now.fi = vi{now.fi[5]};
                        now.se = vi{now.se[5]};
                    }
                } else {
                    now.fi.erase(now.fi.begin()), now.se.erase(now.se.begin());
                    now.fi[1] = now.se[1] = 0;
                }
            } else if (now.fi.size() == 5) {
                if (i == j) now.fi = vi{i}, now.se = vi{j};
                else if (!check4(now.fi[2], now.fi[3], i, j, now.se[2], now.se[3], j, i)) now.fi = vi{i}, now.se = vi{j};
                else now.fi[0] = now.fi[1] = now.se[0] = now.se[1] = 0;
            }
            if (now.fi.size() == 4) {
                if (!check4(now.fi[0], now.fi[1], now.fi[2], now.fi[3], now.se[0], now.se[1], now.se[2], now.se[3])) {
                    if (now.fi[0] != now.se[0]) continue;
                    else now.fi.erase(now.fi.begin()), now.se.erase(now.se.begin());
                } else if (now.fi[0] != now.se[0] || now.fi[1] != now.se[1]) now.fi.clear(), now.se.clear();
            }
            if (now.fi.size() == 3) {
                if (now.fi[0] == now.se[0]) {
                    bool fl = 0;
                    for (int k = 1; k <= 9; k++)
                        for (int l = 1; l <= 9; l++)
                            if (check4(now.fi[0], now.fi[1], now.fi[2], k, now.se[0], now.se[1], now.se[2], l)
                                    && !check2(now.fi[1], now.fi[2], now.se[1], now.se[2])
                                    && !check2(now.fi[2], k, now.se[2], l) && (now.fi[1] != now.se[1] || now.fi[2] != now.se[2]))
                                fl = 1;
                    if (!fl) now.fi.erase(now.fi.begin()), now.se.erase(now.se.begin());
                } else {
                    bool fl = 0;
                    for (int k = 1; k <= 9; k++)
                        for (int l = 1; l <= 9; l++)
                            if (check4(now.fi[0], now.fi[1], now.fi[2], k, now.se[0], now.se[1], now.se[2], l))
                                fl = 1;
                    if (!fl) continue;
                }
            }
            if (now.fi.size() == 2) {
                if (now.fi[0] != now.se[0] && check2(now.fi[0], now.fi[1], now.se[0], now.se[1])) now.fi.clear(), now.se.clear();
                else if (now.fi[0] == now.se[0]) {
                    if (now.fi[0] == now.fi[1] || now.se[0] == now.se[1]) now.fi.erase(now.fi.begin()), now.se.erase(now.se.begin());
                    if (abs(pl[now.fi[1]].fi - pl[now.fi[0]].fi) > 1 || abs(pl[now.fi[1]].se - pl[now.fi[0]].se) > 1
                        || abs(pl[now.se[1]].fi - pl[now.fi[0]].fi) > 1 || abs(pl[now.se[1]].se - pl[now.fi[0]].se) > 1)
                        now.fi.erase(now.fi.begin()), now.se.erase(now.se.begin());
                } else if (now.fi[0] == now.fi[1] || now.se[0] == now.se[1]) continue;
            }
            if (!dfn.count(now)) dfs(now);
            trans[lab][i][j] = dfn[now];
        }
    }
}

int main() {
    dfs(mp(vi(), vi()));
    for (int i = 1; i <= ncnt; i++) {
        pair<vi, vi> u = rnk[i];
        if (u.fi.size() == 0) can[i] = 1;
        else if (u.fi.size() == 1) can[i] = u.fi[0] == u.se[0];
        else if (u.fi.size() == 2) can[i] = u.fi[0] == u.se[0] && u.fi[1] == u.se[1];
        else if (u.fi.size() == 3) can[i] = (u.fi[0] == u.se[0] && check2(u.fi[1], u.fi[2], u.se[1], u.se[2])) || check2(u.fi[0], u.fi[1], u.se[0], u.se[1]) && u.fi[2] == u.se[2];
        else if (u.fi.size() == 4) can[i] = 1;
        else if (u.fi.size() == 5) can[i] = abs(pl[u.fi[3]].fi - pl[u.fi[4]].fi) == 1 && abs(pl[u.fi[3]].se - pl[u.fi[4]].se) == 1;
    }
    int T; read(T);
    while (T--) {
        scanf("%s", s + 1);
        n = strlen(s + 1);
        for (int i = 1; i <= ncnt; i++) d[i] = f[i] = 0;
        d[1] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= ncnt; j++) {
                if (!d[j]) continue;
                for (int k = 1; k <= 9; k++) f[trans[j][s[i] - '0'][k]] += d[j];
            }
            for (int j = 1; j <= ncnt; j++) d[j] = f[j] % P, f[j] = 0;
        }
        LL ans = 0;
        for (int i = 1; i <= ncnt; i++)
            if (can[i])
                ans = (ans + d[i]) % P;
        printf("%lld\n", ans);
    }
    return 0;
}