ACM！荣耀之路！

Problem Description　　小明自从告别了ACM/ICPC之后，就开始潜心研究数学问题了，一则可以为接下来的考研做准备，再者可以借此机会帮助一些同学，尤其是漂亮的师妹。这不，班里唯一的女生又拿一道数学题来请教小明，小明当然很高兴的就接受了。不过等他仔细读题以后，发现自己也不会做，这下小明囧了：如果回复说自己不懂，岂不是很没面子？　　所以，他现在私下求你帮忙解决这道题目，题目是

DescriptionFermat's theorem states that for any prime number p and for any integera > 1,ap = a (mod p). That is, if we raisea to thepth power and divide by p, the remainder isa. Some (but not

Problem DescriptionXinlv wrote some sequences on the paper a long time ago, they might be arithmetic or geometric sequences. The numbers are not very clear now, and only the first three numbers of e