Treasures

And that is what became of me, Jim. All because in my youth I went to the graveyard to play heads or tails!

Ben Gunn

Being the only person on the island, Ben Gunn lost his mind. He split the treasure in the cave into $n$ piles and laid them out in a row. Now he keeps seeing Captain Flint, who wants to take part of the treasure from him.

Since Flint is only a hallucination, his demands are unusual. He wants to take $k$ piles that lie consecutively in the row, so that the total value of these piles is at least the total value of all the other treasure. The number of piles must be as small as possible.

Ben Gunn cannot say what the value of each pile is. He only remembers the values of the first two piles, and that he computed the value of the $i$-th pile by the formula

$(a \cdot t_{i-2} + b \cdot t_{i-1} + c) \mod d$

where $a$, $b$, $c$, and $d$ are constants that Nick Allardyce gave him, and $t_{i-1}$ and $t_{i-2}$ are the values of the $(i-1)$-th and $(i-2)$-th piles.

Help Ben Gunn give part of his treasure to Flint.

The first line contains $n$ ($2 \le n \le 10^7$), the number of piles. The second line contains $x$ and $y$ ($0 \le x,y \le 10^9$), the values of the first two piles. The third line contains $a$, $b$, $c$, and $d$ ($0 \le a, b, c \le 10^9, 1 \le d \le 10^9$).

Print the numbers of the first and the last piles Flint should take. If there are several answers, print any of them.

Note that memory is limited in this problem.