蓝桥杯-最小正整数解

"""
https://www.lanqiao.cn/problems/1297/learning/?page=1&first_category_id=1&problem_id=1297
"""
"""
裴蜀定理: 当a和b是不全为0的整数, ax+by=m有整数解, 则m必须是gcd(a, b)的倍数

令ax + by = m, 且gcd(a, b) = g, 则a = k1 * g, b = k2 * g
所以ax + by = k1*g*x + k2*g*y = (k1*x + k2*y) * g, 是gcd(a, b)的倍数
所以ax + by = k*gcd(a, b)
当k=1时, ax + by值最小的, 为gcd(a, b), 而且根据裴蜀定理, 此时x, y是有整数解的
"""
import os
import sys
input = sys.stdin.readline

def gcd(a, b):
  # 欧几里得定理: gcd(a, b) == gcd(b, a mod b)
  if b == 0:
    return a
  return gcd(b, a % b)

T = int(input())
for i in range(T):
  a, b = map(abs, map(int,input().split()))
  # a, b正负不会影响到最大公因数的值
  # gcd(a, b) = gcd(a, -b) = gcd(-a, -b) = gcd(-a, b)
  print(gcd(a, b))