#include <bits/stdc++.h>
using i64 = long long;
constexpr int MOD = 1e9 + 7;
constexpr i64 ans[9][9] = {{0, 0, 0, 0, 0, 0, 0, 0, 0}, 
                            {0, 15, 339, 4761, 52929, 517761, 4767849, 43046721, 387420489}, 
                            {0, 339, 16485, 518265, 14321907, 387406809, 460338013, 429534507, 597431612}, 
                            {0, 4761, 518265, 43022385, 486780060, 429534507, 792294829, 175880701, 246336683},
                            {0, 52929, 14321907, 486780060, 288599194, 130653412, 748778899, 953271190, 644897553},
                            {0, 517761, 387406809, 429534507, 130653412, 246336683, 579440654, 412233812, 518446848},
                            {0, 4767849, 460338013, 792294829, 748778899, 579440654, 236701429, 666021604, 589237756},
                            {0, 43046721, 429534507, 175880701, 953271190, 412233812, 666021604, 767713261, 966670169},
                            {0, 387420489, 597431612, 246336683, 644897553, 518446848, 589237756, 966670169, 968803245},};

i64 qpow(i64 a, i64 b) {
    i64 ans = 1;
    for (; b; b >>= 1) {
        if (b & 1) ans = ans * a % MOD;
        a = a * a % MOD;
    }
    return ans;
}

void solve() {
    i64 n, m;
    std::cin >> n >> m;
    if (n <= 9 && m <= 9) {
        std::cout << ans[n - 1][m - 1] << '\n';
    } else {
        std::cout << (3, n * m) << '\n';
    }

}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);

    int T;
    std::cin >> T;
    while (T--) {
        solve();
    }
}