Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Deputies

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe Trinitarian kingdom has exactly *n* = 3*k* cities. All of them are located on the shores of river Trissisipi, which flows through the whole kingdom. Some of the cities are located on one side of the river, and all the rest are on the other side.

Some cities are connected by bridges built between them. Each bridge connects two cities that are located on the opposite sides of the river. Between any two cities exists no more than one bridge.

The recently inaugurated King Tristan the Third is busy distributing his deputies among cities. In total there are *k* deputies and the king wants to commission each of them to control exactly three cities. However, no deputy can be entrusted to manage the cities, which are connected by a bridge — the deputy can set a too high fee for travelling over the bridge to benefit his pocket, which is bad for the reputation of the king.

Help King Tristan the Third distribute the deputies between the cities, if it is possible.

Input

The first line contains two integers *n* and *m* — the number of cities and bridges (3 ≤ *n* < 10^{5}, *n* = 3*k*, 0 ≤ *m* ≤ 10^{5}). Next *m* lines describe the bridges. The *i*-th line contains two integers *a*_{i} and *b*_{i} — the numbers of cities that are connected by the *i*-th bridge (1 ≤ *a*_{i}, *b*_{i} ≤ *n*, *a*_{i} ≠ *b*_{i}, 1 ≤ *i* ≤ *m*).

It is guaranteed that no bridge connects a city with itself and that any two cities are connected with no more than one bridge.

Output

If distributing the deputies in the required manner is impossible, print in a single line "NO" (without the quotes).

Otherwise, in the first line print "YES" (without the quotes), and in the second line print which deputy should be put in charge of each city. The *i*-th number should represent the number of the deputy (from 1 to *k*), who should be in charge of city numbered *i*-th in the input — overall there should be *n* numbers.

If there are multiple solutions, print any of them.

Examples

Input

6 6

1 2

4 1

3 5

6 5

2 6

4 6

Output

YES

1 2 1 2 2 1

Input

3 1

1 2

Output

NO

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/21/2018 20:25:38 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|