#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<climits>
#include<iomanip>
#include<cassert>
using namespace std;
typedef long long LL;
typedef long double LB;
#define N 555
#define mod 1000000007
#define PI acos(-1)
const int INF=INT_MAX;
int main()
{
    int t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        int s=0;
        while(1)
        {
            if(n<m) swap(n,m);
            if(n%m==0) {s+=n/m;break;}
            s+=n/m;
            n=n%m;

        }
        printf("%d\n",s);
    }
    return 0;
}