#include<bits/stdc++.h>
#define int long long
#define gcd __gcd
using namespace std;
const int maxn=1e7+10;
int t,n,a,b,c,ans;
void output(int n,int m)
{
    int g=abs(gcd(n,m));
    n/=g;
	m/=g;
    if(m==1)
    {
    	cout<<n;
	}
    else
    {
    	cout<<n<<"/"<<m;
	}
}
signed main()
{
	cin>>t>>n;
	while(t--)
	{
		cin>>a>>b>>c;
		int delta=b*b-4*a*c;
		if(delta<0)
		{
			cout<<"NO";
		}
		else if(delta==0)
		{
			output(-b,2*a);
		}
		else
		{
			if((long long)sqrt(delta)*(long long)sqrt(delta)==delta)
			{
				if(a<0)
				{
					output(-b-sqrt(delta),2*a);
					
				}
				else
				{
					output(-b+sqrt(delta),2*a);
					
				}
			}
			else
			{
				if(b!=0)
				{
					output(-b,2*a);
					cout<<"+";
				}
				if(a<0)
				{
					a=-a;
				}
				int x=0;
				for(int i=sqrt(delta);i>=1;i--)
				{
					if(delta%(i*i)==0)
					{
						x=i;
						break;
					}
				}
				delta/=x*x;
				if(x==2*a)
				{
					cout<<"sqrt("<<delta<<")"; 
				}
				else if(x%(2*a)==0)
				{
					cout<<x/(2*a)<<"*sqrt("<<delta<<")";
				} 
				else
				{
					int m,y,z;
					m=gcd(m,2*a);
					y=x/m;
					z=2*a/m;
					if(y==1)
					{
						printf("sqrt(%lld)/%lld",delta,z);
					}
					else
					{
						printf("%lld*sqrt(%lld)/%lld",y,delta,z);
					}
				}
			}
		}
		cout<<endl;
	}
	return 0;
}