Aditya_R9463

ShikamaruNara6943

Jiraiya6741

RoronoaZoro9834

absolute99

QuantumCoder_09

ErenJaeger4168

LeviAckerman1945

NarutoUzumaki1579

ItachiUchiha8569

NarutoUzumaki4387

ErenJaeger8289

KilluaZoldyck6594

MinatoNamikaze7918

MadaraUchiha1047

Saitama2431

EdwardElric0356

ShikamaruNara9049

GonFreecss2747

Jiraiya3471

MonkeyDLuffy5802

RoronoaZoro1194

RockLee9491

Korosensei5615

Gaara7807

LeviAckerman0334

KakashiHatake9424

piyush__99

KilluaZoldyck6694

KakashiHatake4658

ItachiUchiha7724

NarutoUzumaki1107

Saitama8785

ErenJaeger7200

MinatoNamikaze3496

MadaraUchiha0868

Jiraiya4923

ShikamaruNara9293

GonFreecss6898

from itertools import chain, combinations, permutations
from collections import defaultdict, Counter, deque
from math import ceil, floor, gcd, inf, log2, sqrt
from bisect import bisect_right as upper_bound
from bisect import bisect_left as lower_bound
from random import choices, randint, sample
from functools import lru_cache, reduce
from heapq import heappop, heappush
from sys import stdin, stdout
from gzip import decompress
import builtins

import sys
from bisect import bisect_right
input = sys.stdin.readline
def solve():
    n, q = map(int, input().split())
    sz = []
    ele = []
    bda = 10**19
    prf = [-1] * (n+1)
    for i in range(n):
        a2 = list(map(int, input().split()))
        b = a2[0]
        if b == 1:
            x = a2[1]
            if not sz:
                sz.append(0)
                ele.append(x)
            else:
                sz.append(sz[-1] + 1)
                ele.append(x)
        else:
            x = a2[1]
            oh = (sz[-1] + 1) * (x + 1) - 1
            if oh >= bda:
                sz.append(bda)
                continue
            sz.append(oh)
            ele.append(ele[-1])
            prf[i] = sz[-1] + 1
    a3 = list(map(int, input().split()))
    for iii in range(q):
        num = a3[iii] - 1
        while True:
            ex = bisect_right(sz, num) - 1
            if sz[ex] == num:
                print(ele[ex], end=" ")
                break
            num = num % (sz[ex] + 1)
    print()
    
    if __name__ == "__main__":
    for _ in range(int(input())):
        solve()