The Crow's Last Attack

A hero summons a crow that attacks a line of enemies.

The line holds $n$ enemies, numbered $1$ to $n$ from left to right. Enemy $i$ starts with $h_i$ hitpoints. The two ends of the line are connected. Moving right past enemy $n$ leads to enemy $1$, and moving left past enemy $1$ leads to enemy $n$.

The crow starts on enemy $1$ facing right. One attack subtracts $C$ hitpoints from the enemy the crow stands on. An enemy whose hitpoints drop to $0$ or below is dead.

After every attack the crow follows these rules.

1. If the attack killed the enemy, the crow immediately reverses its direction.
2. The crow then moves in its current direction to the nearest enemy that is still alive, passing over dead enemies without attacking them.

The crow attacks $n + 5$ times. If every enemy is dead before that count is reached, the crow stops attacking.

Print the number of the enemy that receives the crow's last attack.

The first line contains the number of test cases $T$ ($1 \le T \le 100$).

The first line of each test case contains two space-separated integers $n$ and $C$, the number of enemies and the crow's damage ($2 \le n \le 32$, $32 \le C \le 128$). The next line contains $n$ integers $h_1, h_2, \dots, h_n$, the initial hitpoints of the enemies in order ($1 \le h_i \le 10000$).

For each test case, print the number of the enemy that receives the crow's last attack on its own line.