# blocks = [5,8,3,1,5,6,9,9,2,2,4] def dump() : blocks[-1] = blocks[-1] -1 blocks[0] = blocks[0] + 1 if blocks[0] > blocks[1] or blocks[-1] < blocks[-2] : blocks.sort() def find_min_max () : return blocks[-1] -blocks[0]

for t in range(1, 11) : N = int(input().strip()) words = input().strip() lines = input().strip() strs = lines.split(words) print("#" + str(N) + " " + str(len(strs)-1))

for test_case in range(1, 11): stack = [] n, nums = input().split() nums = list(nums.strip()) for num in nums: if not stack: stack.append(num) else: if stack[-1] == num: stack.pop() else: stack.append(num) print('#' + str(test_case), ''.join(stack))