1374. Motorways

单点时限: 2.0 sec

内存限制: 256 MB

Task

Write a program which:

reads from the standard input the information on motorways that are planned,

determines the positions of the motorways (or states that it is not possible to build them according to the given rules),

writes the result to the standard output.

The memory limit for this task is 32 MB.

输入格式

In the first line of the standard input there are two integers: the number of towns n and the number of the planned motorways k, 1 <= n,k <= 20000. In the following lines there are pairs of towns which are to be connected by motorways. In the (i+1)-st line there are two integers pi, qi separated by a single space: the numbers of the towns that the i-th motorway is to connect, 1 <= pi < qi <= n. Pairs of towns are not repeated in the input data.

输出格式

Your program should write to the standard output an arrangement plan of the motorways or a single word NIE (“no” in Polish), if it is not possible to construct all the motorways according to the given rules. If the construction of the motorways is possible then your program should write k lines to the standard output. In the i-th line there should be one capital letter, respectively: N - if the motorway connecting the towns pi and qi should be constructed to the north of the railway line, or S - if to the south of the railway line. If there exist many possible solutions, your program should write only one of them (arbitrary).

样例

Input
8 7
1 2
1 3
2 4
5 7
4 8
7 8
6 8
Output
N
N
S
S
S
N
N

0 人解决,1 人已尝试。

0 份提交通过,共有 1 份提交。

9.9 EMB 奖励。

创建: 16 年,11 月前.

修改: 6 年,10 月前.

最后提交: 4 年,8 月前.

来源: POI

题目标签