Question

Eugene must do his homework, but he is struggling
He has three integer numbers: A, N, M. He writes number A on the board N times in a row. Let's call the
resulting big number X. Help Eugene find X modulo M.
Constraints
1 <= T <= 200
0 <= A <= 1000 (13)
0<N< 1000000000000 (1012)
1 <M< 1000000000 (109)
O Type here to search
OBI​

Answer 1

Answer:

I don't know the answer

I only want point

Step-by-step explanation:

I am very sorry