645 B | 645 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def solve():
m, n = mii()
A = {*mii()}
B = {*mii()}
intersect = len(A.intersection(B))
union = len(A) + len(B) - intersect
p(int(intersect * 2 > union))
if __name__ == "__main__":
tc = ii()
for t in range(1, tc+1):
ret = solve()