#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <memory.h>
#include <set>
#include <string.h>
#include <list>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <time.h>
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(int i=1;i<=n;++i)
#define repc(i,l,r) for(int i=l;i<=r;++i)
#define mp(a,b) make_pair(a,b)
#define llf long double
#define pii pair<int,int>
using namespace std;
void solve(){
    int n,m;
    cin>>n>>m;
    ll cnt=0;
    while(n&&m){
        if(n<m) swap(n,m);
        cnt+=n/m;
        n%=m;
    }
    cout<<cnt<<endl;
}
int main(){
    //freopen("abc", "r", stdin);
   int T;
   cin>>T;
   while(T--)
    solve();
    return 0;
}