import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class BitSum:
    def __init__(self, n):
        self._n = n+1
        self._table = [0]*self._n

    def add(self, i, x):
        if x == 0: return
        i += 1
        while i < self._n:
            self._table[i] += x
            self._table[i] %= b
            i += i & -i

    def sum(self, r):
        res = 0
        while r > 0:
            res += self._table[r]
            res %= b
            r -= r & -r
        return res

n, b, q = LI()

cc = [[1]*101 for _ in range(101)]
for i in range(1, 101):
    for j in range(1, i):
        cc[i][j] = (cc[i-1][j-1]+cc[i-1][j])%b
# p2D(cc)

bit = [BitSum(n) for _ in range(101)]

for _ in range(q):
    l, m, r, c, d = LI()
    p = 1
    for i in range(d+1)[::-1]:
        cur = p*cc[d][i]%b
        bit[i].add(l-1, cur)
        bit[i].add(r, -cur)
        p = p*c%b
    p = 1
    ans = 0
    for i in range(101):
        ans += p*bit[i].sum(m)
        ans %= b
        p = p*m%b
    print(ans)