time limit per test: 0.25 sec.
memory limit per test: 4096 KB

input: standard
output: standard

Let {x_i} be the infinite sequence of integers:
1) x₀ = A;
2) x_i = (alpha * x_i-1^2 + beta * x_i-1 + gamma) mod M, for i >= 1.
Your task is to find x_k if you know A, alpha, beta, gamma, M and k.

Given A (1 <= A <= 10000), alpha (0 <= alpha <= 100), beta (0 <= beta <= 100), gamma (0 <= gamma <= 100), M (1 <= M <= 1000), k (0 <= k <= 10^9). All numbers are integer.

Write x_k.

Input

1 1 1 1 10 1