Welcome to ZOJ
 Problem Sets Information Select Problem Runs Ranklist
ZOJ Problem Set - 2457
Magic Multiplying Machine

Time Limit: 5 Seconds      Memory Limit: 32768 KB      Special Judge

Well known Las-Vegas casino "Big Jo" has recently introduced the new playing machine, called Magic Multiplying Machine (MMM). MMM has N levers and one big red button. Each lever is marked with some integer number ranging from 1 to M, thus i-th lever is marked with number ai.

A player who wishes to play on MMM inserts a coin into a special slot. After that she chooses some levers and pulls them. After she has made her choice, she presses the big red button. MMM blinks all its lights, rings its bells, plays different tunes and after that declares whether player has won the game.

The algorithm for determining whether the player has won is the following. If the player has pulled some subset S { 1, 2, . . . N } of levers, her score is the product of numbers that these levers are marked with, taken modulo M (if the player has pulled no levers, her score is 1):

Player has won the game if her score is maximal possible for the given machine.

Given the description of some MMM determine which levers should be pulled to win the game.

### Input

Input consists of multiple test cases.
For each case, the first line contains two integer numbers N and M (1 N 10 000, 2 M 1 000). The second line contains N integer numbers ranging from 1 to M -- a1, a2, . . . aN.

### Output

For each test case, print in the first line one integer number -- the score that should be obtained to win the game. On the second line print in ascending order, ONLY if there are any, the numbers of levers that should be pulled to obtain this score (levers are numbered starting from one). If there are several solutions, output any one.

```4 4
4 4 4 4
4 6
1 2 3 4
```

### Possible Output for Sample Input

```1
4
1 4
```

Source: Northeastern Europe 2002, Northern Subregion
Submit    Status