//从最大最小开始二分,直到分母超m,取两边较小
#include <bits/stdc++.h>
using namespace std;
int main()
{
double p;
int t,k,m;
cin>>t;
while(t--)
{
cin>>k >>m>>p;
int x1 = 0,y1 = 1, x3 = 1,y3 = 1;
int x2,y2;
while(true)
{
x2 = x1 + x3;
y2 = y1 + y3;
if(y2 > m)
break;
if(x2 * 1.0 / y2 <= p)
{
x1 = x2;
y1 = y2;
}
else
{
x3 = x2;
y3 = y2;
}
}
cout<<k<<' ';
if(fabs(x1 * 1.0 /y1 - p)> fabs(x3 * 1.0 / y3- p))
{
cout<<x3<<'/'<<y3<<endl;
}
else
{
cout<<x1<<'/'<<y1<<endl;
}
}
}