#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
template <class T>
inline T isqrt(T k) {
  T r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
template <class T>
inline T icbrt(T k) {
  T r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
const int maxn = 2000 + 10;
const int maxm = 500000 + 10;
int n, m;
int a[maxm];
int b[maxm];
bitset<maxn << 1> mat[maxn];
void solve() {
  cin >> n >> m;
  for (int i = (0); i < (m); i++) {
    cin >> a[i] >> b[i], a[i]--, b[i]--;
    mat[b[i]][a[i]] = 1;
  }
  for (int i = (0); i < (n); i++)
    for (int j = (0); j < (n); j++) mat[i][j + n] = i == j;
  for (int i = (0); i < (n); i++) {
    if (!mat[i][i]) {
      for (int j = (i + 1); j < (n); j++)
        if (mat[j][i]) {
          mat[i] ^= mat[j];
          break;
        }
    }
    for (int j = (0); j < (n); j++) {
      if (j == i) continue;
      if (mat[j][i]) {
        mat[j] ^= mat[i];
      }
    }
  }
  for (int i = (0); i < (m); i++) {
    if (!mat[a[i]][b[i] + n]) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
