t = int(input())
while t:
n, m, st = input().split()
n = int(n)
m = int(m)
sol = {}
sol[int(st)-1] = True
final_sol = {}
for i in range(0, int(m)):
l1, sign = input().split()
l1 = int(l1)
temp_list = []
if sign == "?":
for k, v in sol.items():
temp_list.append((k+l1)%n)
temp_list.append((k+n-l1)%n)
elif sign == "0":
for k, v in sol.items():
temp_list.append((k+l1)%n)
elif sign == "1":
for k, v in sol.items():
temp_list.append((k+n-l1)%n)
sol = {}
for each in temp_list:
if each not in sol:
sol[each] = True
if i == int(m) -1:
for each in temp_list:
if each not in final_sol:
final_sol[each] = True
final_l = []
for k, v in final_sol.items():
final_l.append(k)
final_l.sort()
print(len(final_l))
for each in final_l:
print(each+1, end=" ")
print("")
t -= 1
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |