#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
vector<int> convert(int x,int b)
{
  if(x==0) return {0};
  vector<int>res;
  while(x)
    res.emplace_back(x%b),x/=b;
  reverse(res.begin(),res.end());
  return res;
}
vector<int>get_factor(int n)
{
  vector<int>res;
  for(int i=1;i*i<=n;i++)
    if(n%i==0) res.emplace_back(i);
  res.emplace_back(n);
  return res;
}
void solve()
{
  int x,y,A,B;
  cin>>x>>y>>A>>B;
  int sx=sqrt(x),sy=sqrt(y);
  for(int a=2;a<=min(sx,A);a++)
  {
    vector<int>s=convert(x,a);
    int l=2,r=B,b=0;
    auto check=[=](int x)
    {
      long long sum=0;
      for(int v:s)
      {
        sum=sum*x+v;
        if(sum>y) return false;
      }
      return true;
    };
    while(l<=r)
    {
      int mid=(l+r)/2;
      if(check(mid)) b=mid,l=mid+1;
      else r=mid-1;
    }
    long long sum=0;
    bool flag=true;
    for(int v:s)
    {
      sum=sum*b+v;
      if(v>=b||sum>y)
      {
        flag=false;
        break;
      }
    }
    if(sum==y&&flag)
    {
      cout<<"YES\n";
      cout<<a<<" "<<b<<"\n";
      return;
    }
  }
  for(int b=2;b<=min(sy,B);b++)
  {
    vector<int>s=convert(y,b);
    int l=2,r=A,a=0;
    auto check=[=](int x)
    {
      long long sum=0;
      for(int v:s)
      {
        sum=sum*x+v;
        if(sum>x) return false;
      }
      return true;
    };
    while(l<=r)
    {
      int mid=(l+r)/2;
      if(check(mid)) a=mid,l=mid+1;
      else r=mid-1;
    }
    long long sum=0;
    bool flag=true;
    for(int v:s)
    {
      sum=sum*a+v;
      if(v>=a||sum>x)
      {
        flag=false;
        break;
      }
    }
    if(sum==x&&flag)
    {
      cout<<"YES\n";
      cout<<a<<" "<<b<<"\n";
      return;
    }
  }
  if(x>y)
  {
    vector<int>p=get_factor(x-y);
    for(int m:p)
    {
      int d=(x-y)/m;
      int b=max(m+1,sy+1),a=b+d;
      if(a<sx+1)
      {
        int t=sx+1-a;
        b+=t,a+=t;
      }
      if(a<=x/(m+1))
      {
        int t=x/(m+1)+1-a;
        a+=t,b+=t;
      }
      if(b<=y/(m+1))
      {
        int t=y/(m+1)+1-b;
        a+=t,b+=t;
      }
      int n=x-m*a;
      if(n<0) continue;
      if(a<=A&&b<=B)
      {
        cout<<"YES\n";
        cout<<a<<" "<<b<<"\n";
        return;
      }
    }
    cout<<"NO\n";
    return;
  }
  else if(x<y)
  {
    vector<int>p=get_factor(y-x);
    for(int m:p)
    {
      int d=(y-x)/m;
      int a=max(m+1,sx+1),b=a+d;
      if(b<sy+1)
      {
        int t=sy+1-b;
        a+=t,b+=t;
      }
      if(a<=x/(m+1))
      {
        int t=x/(m+1)+1-a;
        a+=t,b+=t;
      }
      if(b<=y/(m+1))
      {
        int t=y/(m+1)+1-b;
        a+=t,b+=t;
      }
      int n=x-m*a;
      if(n<0) continue;
      if(a<=A&&b<=B)
      {
        cout<<"YES\n";
        cout<<a<<" "<<b<<"\n";
        return;
      }
    }
    cout<<"NO\n";
    return;
  }
  else
  {
    cout<<"YES\n";
    cout<<2<<" "<<2<<"\n";
    return;
  }
  return;
}
signed main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr),cout.tie(nullptr);
  int T;
  cin>>T;
  while(T--)
    solve();
  return 0;
}