#include<bits/stdc++.h>
using namespace std;
inline void solve()
{
    long long n,u,v;
    scanf("%lld %lld %lld",&n,&u,&v);
    auto work=[&](long long u,long long v)->int
    {
        long long now=v;
        int step=0;
        while(now!=u)
        {
            if(n%now==0)
                return INT_MAX;
            now-=n%now;
            step++;
        }
        return step;
    };
    int x=work(u,v),y=work(v,u);
    if(x==INT_MAX&&y==INT_MAX)
        printf("-1\n");
    else
        printf("%d\n",min(x,y));
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--)
        solve();

    return 0;
}