Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

## SPQUEUE - Queue

Hiện tại, bài tập này đã có trên online judge chính thức của VNOI, bạn có thể truy cập ở đây: https://oj.vnoi.info/problem/spqueue

On some special occasion Nadia’s company provide very special lunch for all employees of the company. Before the food is served all of the employees must stand in a queue in front of the food counter. The company applied a rule for standing in the queue. For instance if Abul is the supervisor of Babul and Abul stands in kth position from the front of the queue, then Babul cannot stand at any position in between 1 and k-1 from front of the queue. The company has N employees and each of them has one supervisor except one who doesn’t have any supervisor.

You need to calculate in how many ways the queue can be created. You can safely assume that in at least one way the queue can be created.

### Input

The first line is the number of test cases.

Each test case:

-         The first line contains 2 integers M and N.

-         Line 2..N: consist of one integer is supervisor of i-employees.

### Output

For each test case: the result of this problem module M in one line.

### Example

`Input:12 21Output:1Constraints:- Number of test cases <= 10 for small data, N <= 100000- Number of test cases = 1 for large data, N <= 500000- 1 <= M <= 1000000000- Time Limit for all tests: 2s`

 Được gửi lên bởi: HNUE Ngày: 2010-12-20 Thời gian chạy: 2s Giới hạn mã nguồn: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Ngôn ngữ cho phép: Tất cả ngoại trừ: ASM64 GOSU PERL6 PYPY RUST SED Nguồn bài: Based on ACM Kuala Lumpur