No tag edit access

D. Permutations

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOstap Bender is worried that people started to forget that he is the Great Combinator. Now he wants to show them his skills in combinatorics. Now he studies the permutations of length *n*. He has a list of *m* valid pairs, pair *a*_{i} and *b*_{i} means that he is allowed to place integers *b*_{i} at position *a*_{i}.

He knows that the number of permutations that use only valid pairs is odd. Now, for each pair he wants to find out, will the number of valid permutations be odd if he removes this pair (and only it) from the list.

Input

The first line contains two integers *n* and *m* (1 ≤ *n* ≤ 2000, *n* ≤ *m* ≤ *min*(*n*^{2}, 500 000)) — the number of elements in the permutation. Then follow *m* lines, each containing some valid pair (*a*_{i}, *b*_{i}) (1 ≤ *a*_{i}, *b*_{i} ≤ *n*). It's guaranteed that no pair occurs in the input twice and that the total number of valid permutations (i.e. using only allowed pairs position-elements) is odd.

Output

Print *m* lines, one line for each valid pair. The *i*-th line should contain "YES" if after Ostap removes the *i*-th pair (and only it) the remaining number of valid permutations is odd. Otherwise, print «NO».

Examples

Input

2 3

1 1

1 2

2 2

Output

NO

YES

NO

Input

3 3

1 1

2 2

3 3

Output

NO

NO

NO

Input

3 7

3 3

3 1

1 3

1 1

2 2

1 2

2 1

Output

YES

NO

NO

NO

YES

NO

NO

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/18/2018 13:49:32 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|