import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = sys.stdin.readline
input = lambda : inp()[:-1]
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda :list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
getEdges = lambda n : [[x - 1 for x in getNs()] for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 1000000007
MOD = 998244353
INF = 4611686018427387903
dx = [1, 0, -1, 0];  dy = [0, 1, 0, -1]
#di = coll.defaultdict(int)
 
 
"""
Main Code
"""

n, b = getNs()
a = [getList() for _ in [0] * 3]

def matrix_prod(A, B):
	res = [[0] * 3 for _ in range(3)]
	for i in range(3):
		for j in range(3):
			for k in range(3):
				res[i][j] += A[i][k] * B[k][j]
			res[i][j] %= b
	return res

def matrix_exp(A, n):
	res = [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
	while(n):
		if(n & 1):
			res = matrix_prod(A, res)
		A = matrix_prod(A, A)
		n >>= 1
	return res

def determenant(a):
    ret = 0
    mm = a + [a[0]] + [a[1]]
    for i in range(3):
        ret += mm[i][0]*mm[i+1][1]*mm[i+2][2]
        ret -= mm[i][2]*mm[i+1][1]*mm[i+2][0]
    return ret % b

print(determenant(matrix_exp(a, n)))