ZOJ 2317 Nice Patterns Strike Back

import java.util.*;
import java.math.*;
class Matrix
{
	public long [][] a;
	public int n;
	Matrix (int x)
	{
		n = x; a = new long [n][n];
		for (int i=0;i<n;i++) for (int j=0;j<n;j++) a[i][j]=0;
	}
}

public class Main 
{
	public static void main(String[] args) 
	{
		Scanner cin = new Scanner(System.in);
		int T,m,p;
		BigInteger n;
		T = cin.nextInt();
		while((T--)>0)
		{
			n = cin.nextBigInteger();
			m = cin.nextInt(); 
			p = cin.nextInt();
			Matrix A = new Matrix(1<<m);
			for (int i=0;i<(1<<m);i++) 
			{
				for (int j=0;j<(1<<m);j++) 
					if (ok(i,j,m)==1) A.a[i][j]=1;
					else A.a[i][j]=0;
			}
			n = n.subtract(BigInteger.ONE);
			A = ML(A,n,m,p);
			long ans=0;
			for (int i=0;i<(1<<m);i++)
				for (int j=0;j<(1<<m);j++)
					ans=(ans+A.a[i][j])%p;
			System.out.println(ans);
			if (T>0) System.out.println();
		}
		cin.close();
	}
	
	public static int ok(int x,int y,int s)
	{
		for (int i=s-1;i>0;i--)
		{
			int b1 = (((1<<i)&x) > 0) ? 1 : 0; 
			int b2 = (((1<<i)&y) > 0) ? 1 : 0; 
			int b3 = (((1<<(i-1))&x) > 0) ? 1: 0; 
			int b4 = (((1<<(i-1))&y) > 0) ? 1: 0; 
			if (b1==b2 && b2==b3 && b3==b4) return 0; 
		}
		return 1;
	}
	
	public static Matrix M_L(Matrix A,Matrix B,int n,int p)
	{
		Matrix temp = new Matrix(1<<n);
		for (int i=0;i<(1<<n);i++) 
			for (int j=0;j<(1<<n);j++) 
				for (int k=0;k<(1<<n);k++)
					temp.a[i][j]+=((A.a[i][k]*B.a[k][j])%p);
		return temp;
	}
	
	public static Matrix ML(Matrix A,BigInteger n,int m,int p)
	{
		Matrix temp = new Matrix(1<<m);
		for (int i=0;i<(1<<m);i++) for (int j=0;j<(1<<m);j++) if (i==j) temp.a[i][j]=1;
		while(!n.equals(BigInteger.ZERO)) //快速幂
		{
			if((n.and(BigInteger.ONE)).equals(BigInteger.ONE)) {
				temp=M_L(temp, A, m, p);
			}
			A = M_L(A, A, m, p);
			n = n.shiftRight(1);
		}
		return temp;
	}
}