#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
int S,Q;
map<tuple<int,int,int,int>,bool>Mp;
map<tuple<int,int,int>,int>Mx;
inline int dfs(int x,int y,int a,int b);
inline int calc(int Y,int y,int b)
{
    if (Mx.count({Y,y,b})) return Mx[{Y,y,b}];
    int a=Y+y*S;
    int l=1,r=1e12;
    int &res=Mx[{Y,y,b}];
    res=0;
    while (l<=r)
    {
        int x=l+(r-l)/2;
        int nw=0;
        {
            if (b&&y) nw|=dfs(x,y-1,a,b-1);
            if (b&&a-y*S>0) nw|=dfs(x-(a-y*S),y,a,b-1);
        }
        {
            if (a-(x-b*S)<=0) nw=1;
            if (x-b*S>0&&y) nw|=dfs(x,y-1,a-(x-b*S),b);
            if (x-b*S>0&&(a-(x-b*S))-y*S>0) nw|=dfs(x-((a-(x-b*S))-y*S),y,a-(x-b*S),b);
        }
        // cerr<<x<<","<<nw<<"???"<<" "<<dfs(22,1,61,0)<<dfs(39,0,22,1)<<endl;
        if (nw) 
        {
            res=x;
            r=x-1;
        } else l=x+1;
    }
    // cerr<<"!"<<Y<<" "<<y<<" "<<b<<" "<<res<<endl;
    return res;
}
inline int dfs(int x,int y,int a,int b)
{
    if (x<=0) return 0;
    if (a<=0) return 1;
    if (x<=1ll*b*S&&a<=1ll*y*S)
    {
        ll t=min(-x+1ll*b*S,-a+1ll*y*S)/S+1;
        b-=t,y-=t;
    }
    if (x<=1ll*b*S && a-1ll*y*S>=S) return 0;
    if (x-1ll*b*S>=S&&a-1ll*y*S<=S) return 1;
    if (x<=1ll*b*S&&y==0)
    {
        ll t=(-x+1ll*b*S)/(S-1ll*(a-1ll*y*S))+1;
        if (1ll*(a-1ll*y*S)*t>=x) return 0;
        x+=t*(-1ll*(a-1ll*y*S));
        b-=t;
    }
    if (b==0&&a-1ll*y*S<=0)
    {
        int t=min((a+x-1)/x,(y*S-a)/S+1);
        a-=t*x;
        if (a<=0) return 1;
        y-=t;
    }
    if (x<=1ll*b*S||b>0&&a-1ll*y*S<=0) 
    {
        return dfs(a,b-1,x,y)^1;
    }
    if (a-1ll*y*S>=S||b==0) 
    { 
        return dfs(a-x+1ll*b*S,b,x,y)^1;
    }
    ll X=x-1ll*b*S;
    ll Y=a-1ll*y*S;
    if ((__int128)(S-Y)*b>=(S-X)) return 1;
    if ((__int128)(S-X)*y+Y-X>=S) return dfs(a,b-1,x,y)^1;

    __int128 nw=(S-Y);
    if (nw>2*S) return 1;
    if (nw*y>2*S) return 1;if (y) nw*=y;
    if (nw*(b/2)>2*S) return 1;nw*=(b/2);
    if (nw*(b-b/2)>2*S) return 1;nw*=(b-b/2);

    if (x>=calc(Y,y,b)) return 1;
    return 0;

    // if (Mx.count({Y,y,b}))
    // {
    //     if (x<=Mx[{Y,y,b}]) return 0;
    // }
    // if (Mn.count({Y,y,b}))
    // {
    //     if (x>=Mn[{Y,y,b}]) return 1;
    // }
    bool res;
    res=0;
    if (x>1ll*b*S)
    {
        res=dfs(a-x+1ll*b*S,b,x,y)^1;
    }
    cerr<<"?"<<Y<<" "<<y<<" "<<b<<" "<<x<<" "<<res<<" "<<a-x+b*S<<" "<<b<<" "<<x<<" "<<y<<" "<<(dfs(a-x+1ll*b*S,b,x,y)^1)<<endl;
    if (b>0)
    {
        if (!res) 
            res=dfs(a,b-1,x,y)^1;
    }
    // if (res==1) Mn[{Y,y,b}]=x;
    // else Mx[{Y,y,b}]=x;
    cerr<<"?"<<Y<<" "<<y<<" "<<b<<" "<<x<<" "<<res<<endl;
    return res;
}
mt19937_64 rnd(time(0));
const int B=1000000000000;
int ans[1000005];
void BellaKira()
{
    cin>>S>>Q;
    vector<tuple<int,int,int,int,int>>all;
    for (int i=1;i<=Q;i++)
    {
        int x,y,a,b;
        x=rnd()%B+1,y=rnd()%B+1,a=rnd()%B+1,b=rnd()%B+1;
        cin>>x>>y>>a>>b;
        if (dfs(x,y,a,b)) cout<<"YES\n";
        else cout<<"NO\n";
        // if (i%1000==0) cerr<<i<<" "<<sz(Mx)<<endl;
    }
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/