import sys
import math
from collections import defaultdict,Counter,deque

# input=sys.stdin.readline
# def print(x):
#     sys.stdout.write(str(x)+"\n")

import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = "x" in file.mode or "r" not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b"\n") + (not b)
			ptr = self.buffer.tell()
			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode("ascii"))
		self.read = lambda: self.buffer.read().decode("ascii")
		self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# sys.stdout=open("CP3/output.txt",'w')
# sys.stdin=open("CP3/input.txt",'r')

# mod=pow(10,9)+7
t=int(input())
for i in range(t):
	n,m=map(int,input().split())
	a=list(map(int,input().split()))
	x=list(map(int,input().split()))
	pre=[0]*n
	pre[0]=a[0]
	ma=pre[0]
	for j in range(1,n):
		pre[j]=pre[j-1]+a[j]
		ma=max(ma,pre[j])
	ans=[-1]*m
	l=[]
	for j in range(m):
		if pre[-1]<=0:
			if ma<x[j]:
				pass
			else:
				l.append([x[j],j])
		else:
			if ma<x[j]:
				d=x[j]//pre[-1]
				ans[j]=n*(d-1)+n-1
				x[j]-=(d*pre[-1])

			if x[j]:
				l.append([x[j],j])
	l.sort()
	start=0
	for j in range(n):
		while start<len(l) and pre[j]>=l[start][0]:
			if ans[l[start][1]]!=-1:
				ans[l[start][1]]+=j+1
			else:
				ans[l[start][1]]=j

			start+=1
		if start==len(l):
			break

	print(*ans)
