I won't tell you this is about number theory

To think of a beautiful problem description is so hard for me that let's just drop them off. :)
Given four integers a,m,n,k,and S = gcd(a^m-1,a^n-1)%k,calculate the S.

The first line contain a t,then t cases followed.
Each case contain four integers a,m,n,k(1<=a,m,n,k<=10000).

One line with a integer S.

1
1 1 1 1

0

Teddy

ZJFC 2009-3 Programming Contest