#include<cstdio>

 #include<cstring>

 #include<cmath>

 using namespace std;

 int read()

 {

    int x=,f=;char ch=getchar();

    while (ch<''||ch>'') {if (ch=='-') f=-;ch=getchar();}

    while (ch>=''&&ch<='') x=(x<<)+(x<<)+ch-'',ch=getchar();

    return x*f;

 }

 typedef long long ll;

 const int N=;

 int n,m,top[N],f[N][],tot,x,y,ans;

 int main()

 {

     n=read();m=read();int ss=sqrt(n);

     memset(f,,sizeof(f));//边界态

     f[ss+][]=((n-ss-)&);

     for (int i=ss;i>=;i--,tot=)

     {

         for (ll g=i;g<=n;g*=i) tot++;

         for (int j=tot;j>=;j--) f[i][j]=(!f[i+][j]||!f[i][j+]);

     }

     while (m--)

     {

         x=read();y=read();

         if (x>ss) ans=((n-x)&);else ans=f[x][y];

         puts(ans?"Yes":"No");

     }

    return ;

 }