#include<bits/stdc++.h>
using namespace std;
int n, q;
bool jl[510];
struct node
{
    int x, y;
} x[510];
bool check(int i, int j)
{
    int u1;
    if(x[i].x >= x[j].x && x[i].x <= x[j].y)
    {
        u1 = 1;
    }
    else u1 = 0;
    int u2 = 0;
    if(x[i].y >= x[j].x && x[i].y <= x[j].y)
    {
        u2 = 1;
    }
    else u2 = 0;
    if(u1 != u2)
    {
        return 1;
    }
    return 0;
}
int main()
{
    freopen("circle.in", "r", stdin);
    freopen("circle.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> q;
    for(int i = 1; i <= q; i++)
    {
        int xx, y;
        cin >> xx >> y;
        if(y < xx)swap(xx, y);
        x[i].x = xx;
        x[i].y = y;
        for(int j = 1; j < i; j++)
        {
            if(!jl[j])
            {
                if(check(i, j))
                {
                    cout << "No" << '\n';
                    jl[i] = 1;
                    break;
                }
            }
        }
        if(!jl[i])cout << "Yes" << '\n';
    }


    return 0;
}