# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

"""
(1 + x)^n - (1 - x)^n / 2



((sl + sm) ^ n + (sl - sm) ^ n) / 2 ?
"""

from math import sqrt

def calc(n, m, l, b):
    sl = sqrt(l)
    sm = sqrt(m)
    r1 = (l+m) ** n
    r2 = (l-m) ** n
    ans = (r1 + r2) / (2 * sl)
    print(ans)

def solve(n, m, l, b):
    l %= b
    m %= b
    
    a = ((l+m)%b, 2)
    r = (1, 0)
    k = n // 2
    
    def mul(p, q):
        return (p[0]*q[0]+p[1]*q[1]*l*m)%b, (p[0]*q[1]+p[1]*q[0])%b
    
    while k:
        if k & 1:
            r = mul(r, a)
        a = mul(a, a)
        k >>= 1
    
    if n & 1:
        return (r[0] + r[1] * m) % b
    else:
        return r[0] % b

t = II()
for i in range(t):
    n, m, l, b = MI()
    r1 = solve(n, m, l, b)
    print(r1)
    # r2 = calc(n, m, l, b)
    # print()