import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

T = INT()
l = []

for _ in range(T):
    N, AG, BG, AC, BC, AP, BP = MAP()
    BGN = pow(BG, N, mod)
    BCN = pow(BC, N, mod)
    BPN = pow(BP, N, mod)
    up = BGN*BCN*BPN \
    - BCN*BGN*pow(BP-AP, N, mod) \
    - BPN*BGN*pow(BC-AC, N, mod) \
    - BPN*BCN*pow(BG-AG, N, mod) \
    + 2 * (
        BCN*BPN*pow(AG, N, mod) + \
        BGN*BPN*pow(AC, N, mod) + \
        BGN*BCN*pow(AP, N, mod)
        )
    up %= mod
    down = (BGN*BCN*BPN)%mod
    print(up, down)
    l.append((up*pow(down, mod-2, mod))%mod)

print(*l, sep="\n")