## https://yukicoder.me/problems/no/1258

MOD = 10 ** 9 + 7

def solve(N, M, X):
    if M != 1:
        a = pow(1 + M, N, MOD)
        b = pow(1 - M, N, MOD)
        inv2 = pow(2, MOD - 2, MOD)
        if X == 0:
            ans = (a + b) % MOD
            ans *= inv2
            ans %= MOD
        else:
            ans = (a - b) % MOD
            ans *= inv2
            ans %= MOD
        return ans
    else:
        a = pow(1 + M, N, MOD)
        inv2 = pow(2, MOD - 2, MOD)
        ans = a * inv2
        return ans % MOD

            


def main():
    S = int(input())
    answers = []
    for _ in range(S):
        N, M, X = map(int, input().split())
        answers.append(solve(N, M, X))

    for ans in answers:
        print(ans)

if __name__ == "__main__":
    main()