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

    return 0;
}