

CrimeTime Limit: 60000/30000 MS (Java/Others) Memory Limit: 655360/327680 K (Java/Others)Total Submission(s): 708 Accepted Submission(s): 262 Problem Description You kill a person and will be executed by shooting tomorrow,but you have a program contest to do today,after several hours' hard work,you solved all problems except this one.You died with the pity that didn't solved it.But now you have second chance. Count the number of permutation of number 1 to n that every adjacent number are coprime.To avoid large number,output the result mod a number M. Input The first line contains integer T(1<=T<=5).Denoting the number of the test cases. Then T lines follows,each line contains two integers n,M (1<=n<=28, 1<=M<=30000). The n for each test cases will not be the same. Output For each test cases,print the answer in a line. Sample Input
Sample Output
Author WJMZBMR Source Recommend zhuyuanchen520  
