Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
Register
ACM ICPC 2018 World Finals
Language:
Gearbox
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 99 Accepted: 23

Description

Jake decided to take the gearbox of his car apart and put it back together for 'learning purposes'. A gearbox is a box containing many gears, cogs and sprockets (as well as several springs and pinions). All these parts are connected together in intricate ways. Consequently, he is not completely sure if every part is in the correct position again.
All gears are placed on metal rods; when one gear on a rod turns, they all turn by an equal angle. The rods are connected by springs and plastic bars, but Jake is pretty sure he has that part right. The cogs and sprockets are not connected to anything, they are free to rattle around in the box. This may be a bit strange, but a quick Google search reveals that this is customary for gearboxes of this type.
The only problem is that some gears are interlocked, which could cause the main drive shaft to jam. The gearbox uses modern InfiniTeethTM gears, which means that it is impossible to count the number of teeth on a gear. All gears have a type number, and gears of the same type have the same number of teeth. According to the manual (which Jake should have read before he started this mess) all rods should be able to turn, regardless of the number of teeth on each type of gear. So Jake concludes that if this is true for his gearbox it is definitely assembled correctly.

Input

On the first line of the input is a positive integer, the number of test cases. Then for each test case:
A line with three integers ng, nr and ni (all < 105), the number of gears, rods and interlockings.
ng lines, each containing two integers 0 < ti < 100 and 0 <= ri < nr, the type number of gear i and the index of the rod it is on respectively.
ni lines, each containing two integers 0 <= aj < bj < ng, indicating that gears aj and bj are interlocked.

Output

For each test case:
One line containing the text "ok" if the gearbox is de nitely assembled correctly, and "jammed" otherwise.

Sample Input

```4
2 2 1
1 0
2 1
0 1
8 4 4
20 0
10 1
20 2
10 3
30 0
30 1
40 2
40 3
0 1
2 3
4 6
5 7
8 4 4
20 0
10 1
20 2
10 3
30 0
40 1
40 2
30 3
0 1
2 3
4 6
5 7
3 3 3
1 0
1 1
1 2
0 1
0 2
1 2```

Sample Output

```ok
ok
jammed
jammed```

Source

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