#!/bin/python3

import sys

def lena_sort(nums):
    if len(nums) == 1:
        return nums
    
    pivot = nums[0]
    less = []
    more = []
    for i in range(len(nums)):
        if (nums[i] < pivot):
            less.append(nums[i])
        else:
            more.append(nums[i])

    sorted_less = lena_sort(less)
    sorted_more = lena_sort(more)
    ans = sorted_less + pivot + sorted_more
    
    return ans


q = int(input().strip())
for a0 in range(q):
    len,c = input().strip().split(' ')
    len,c = [int(len),int(c)]
    # your code goes here
    if len == 1:
        print(1)