#include <bits/stdc++.h>

using i64 = long long;

template <typename T>
constexpr T power(T a, i64 b) {
    T c{1};
    while (b) {
        if (b % 2) {
            c *= a;
        }
        a *= a;
        b /= 2;
    }
    return c;
}

template <int P>
struct MInt {
    int x;
    constexpr MInt() : x{} {}
    constexpr MInt(i64 x_) : x{up(x_ % getMod())} {}
    constexpr static MInt fromNormed(int x) {
        MInt v{};
        v.x = x;
        return v;
    }

    static int Mod;
    constexpr static int getMod() {
        return P > 0 ? P : Mod;
    }
    constexpr static void setMod(int Mod_) {
        Mod = Mod_;
    }

    inline constexpr static int up(int x) {
        if (x < 0) {
            x += getMod();
        }
        return x;
    }
    inline constexpr static int down(int x) {
        if (x >= getMod()) {
            x -= getMod();
        }
        return x;
    }
    inline constexpr static int norm(int x) {
        return up(down(x));
    }

    inline constexpr int val() const {
        return x;
    }
    inline explicit constexpr operator int() const {
        return val();
    }
    inline constexpr MInt operator-() const {
        MInt res;
        res.x = norm(getMod() - x);
        return res;
    }
    inline constexpr MInt inv() const {
        assert(x != 0);
        return power(*this, getMod() - 2);
    }
    inline constexpr MInt &operator+=(MInt rhs) {
        x = down(x + rhs.x);
        return *this;
    }
    inline constexpr MInt &operator-=(MInt rhs) {
        x = up(x - rhs.x);
        return *this;
    }
    inline constexpr MInt &operator*=(MInt rhs) {
        x = 1ll * x * rhs.x % getMod();
        return *this;
    }
    inline constexpr MInt &operator/=(MInt rhs) {
        return *this *= rhs.inv();
    }
    friend inline constexpr MInt operator+(MInt lhs, MInt rhs) {
        return lhs += rhs;
    }
    friend inline constexpr MInt operator-(MInt lhs, MInt rhs) {
        return lhs -= rhs;
    }
    friend inline constexpr MInt operator*(MInt lhs, MInt rhs) {
        return lhs *= rhs;
    }
    friend inline constexpr MInt operator/(MInt lhs, MInt rhs) {
        return lhs /= rhs;
    }
    friend inline constexpr bool operator==(MInt lhs, MInt rhs) {
        return lhs.val() == rhs.val();
    }
    friend inline constexpr bool operator!=(MInt lhs, MInt rhs) {
        return lhs.val() != rhs.val();
    }
    friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {
        i64 x = 0;
        is >> x;
        a = MInt(x);
        return is;
    }
    friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {
        return os << a.val();
    }
};

template <int P>
int MInt<P>::Mod = P;
template <>
int MInt<0>::Mod = 998244353;

template <int V, int P>
constexpr MInt<P> CInv = MInt<P>(V).inv();

constexpr int P = 1000000007;
using Z = MInt<P>;

const int f[10][10] = {
    {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
    {0, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683},
    {0, 9, 66, 390, 1800, 6120, 13680, 15120, 0, 0},
    {0, 27, 390, 3198, 13176, 27000, 13680, 15120, 0, 0},
    {0, 81, 1800, 13176, 24336, 4320, 0, 0, 0, 0},
    {0, 243, 6120, 27000, 4320, 4320, 0, 0, 0, 0},
    {0, 729, 13680, 13680, 0, 0, 0, 0, 0, 0},
    {0, 2187, 15120, 15120, 0, 0, 0, 0, 0, 0},
    {0, 6561, 0, 0, 0, 0, 0, 0, 0, 0},
    {0, 19683, 0, 0, 0, 0, 0, 0, 0, 0},
};

void solve() {
    int n, m;
    std::cin >> n >> m;

    if (std::min(n, m) == 1) {
        std::cout << "0\n";
        return;
    }

    Z ans = power(Z(3), n * m);
    if (std::max(n, m) <= 9) {
        ans -= f[n][m];
    }
    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}