Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
北京大学《ACM-ICPC竞赛训练》暑期课面向全球招生。容量有限,报名从速!
Language:
Points
Time Limit: 1000MSMemory Limit: 65536K
Total Submissions: 903Accepted: 297

Description

Let p1, p2, . . . , pn be n points on the plane. We have m rules of form pi rel pj , each inform us that the relation rel holds among the locations of points pi and pj on the plane. For example, “pi NE pj” indicates that point pj is located NorthEast of point pi. There are eight different relations {N, E, S, W, NE, NW, SE, SW}, corresponding to the eight directions on the plane. Let (xi, yi) and (xj , yj) be the coordinates of pi, and pj respectively. Then pi rel pj exactly means one of the following, depending on the value of rel:
  1. N stands for North. This means that xj = xi and yj > yi,

  2. E stands for East. This means that xj > xi and yj = yi,

  3. S stands for South. This means that xj = xi and yj < yi,

  4. W stands for West. This means that xj < xi and yj = yi,

  5. NE stands for NorthEast. This means that xj > xi and yj > yi,

  6. NW stands for NorthWest. This means that xj < xi and yj > yi,

  7. SE stands for SouthEast. This means that xj > xi and yj < yi, and

  8. SW stands for SouthWest. This means that xj < xi and yj < yi.
The problem is to determine whether it possible to locate p1, p2, . . . , pn on the plane so that all
given rules are satisfied.

Input

The first line of the input contains a single integer t (1 ≤ t ≤ 20) which is the number of test cases in the input. The first line of each test case contains two integers n (2 ≤ n ≤ 500) which is the number of points and m (1 ≤ m ≤ 10000) which is the number of rules. In each of the following m lines, there is one rule of the form i rel j which means that pi has relation rel with pj.

Output

The output contains one line per each test case containing one of the words POSSIBLE or IMPOSSIBLE indicating if the set of points in the test case can be located on the plane according to the given rules.

Sample Input

2
3 2
1 N 2
2 N 1
6 6
1 E 2
1 E 3
2 N 4
3 NW 5
4 SW 6
6 NE 5

Sample Output

IMPOSSIBLE
POSSIBLE

Source

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator