#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("euclid2.in");
ofstream out("feuclid2.out");

int cmmdc(int a, int b)
{
    if (a == b)
    {
        return a;
    }
    if (a < b) {
        int aux = a;
        a = b;
        b = aux;
    }
    int last = a - b;
    while (true)
    {
        if (last - b == 0)
            return last;

        int f = max(last, b);
        int l = min(last, b);
        last = f - l;
        b = l;
    }
}

int main() {

    int T;
    in >> T;
    for (int i = 1; i <= T; i++)
    {
        int a, b;
        in >> a >> b;
        int x = cmmdc(a, b);
        out << x << endl;
    }
    return 0;
}