Good Bye 2013 |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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.

dp

*3100

No tag edit access

The problem statement has recently been changed. View the changes.

×
G. New Year Cactus

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputJack and Jill are tired of the New Year tree, now they've got a New Year cactus at home! A cactus is a connected undirected graph where any two simple cycles have at most one common vertex. In other words, this graph doesn't have any edges that lie on more than one simple cycle.

On the 31st of December they are going to decorate the cactus by hanging toys to its vertices. At most one toy is going to hang on each vertex — it's either the toy Jack hung or the toy Jill hung. It's possible for a vertex to have no toys.

Jack and Jill has been arguing, so they don't want any edge to connect two vertices where one vertex has Jack's toy and the other vertex has Jill's toy.

Jack has decided to hang *a* toys. What maximum number of toys *b* can Jill hang if they both cooperate to maximize this value? Your task is to write a program that finds the sought *b* for all *a* from 0 to the number of vertices on the New Year Cactus.

Input

The first line contains two integers *n* and *m* (1 ≤ *n* ≤ 2500, *n* - 1 ≤ *m*) — the number of vertices and the number of edges, correspondingly. The next *m* lines contain two integers *a*, *b* each (1 ≤ *a*, *b* ≤ *n*, *a* ≠ *b*) that mean that there is an edge connecting vertices *a* и *b*. Any pair of vertices has at most one edge between them.

Output

The first line must contain space-separated *b*_{a} (for all 0 ≤ *a* ≤ *n*) where *b*_{a} equals the maximum number of Jill's toys on the cactus considering that it has *a* Jack's toys. Numbers *b*_{a} go in the order of increasing *a*.

Examples

Input

1 0

Output

1 0

Input

16 20

1 2

3 4

5 6

6 7

7 8

9 10

10 11

11 12

13 14

15 16

1 5

9 13

14 10

10 6

6 2

15 11

11 7

7 3

16 12

8 4

Output

16 13 12 12 10 8 8 7 6 4 4 3 3 1 0 0 0

Note

The cactus from the second example is:

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/04/2023 10:44:56 (k1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|