#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];

ll qmi(ll a, ll b, ll c) { ll res = 1; while (b) { if (b & 1) res = res * a % c; a = a * a % c; b >>= 1; } return res; }
int mod;
ll f[101][101];
struct ST {
    struct Node {
        int l, r;
        ll sum, flag;
    };
    vector<Node> tr;

    ST(const ST& other) : tr(other.tr) { }
    ST(ST&& other) noexcept : tr(move(other.tr)) { }
    ST (int l, int r) : tr(vector<Node>(((r - l) << 2) + 10)) { build(1, l, r); }

    ST& operator=(ST&& other) noexcept {
        if (this != &other) {
            tr = move(other.tr);
        }
        return *this;
    }
    ST& operator=(const ST& other) {  
        if (this != &other) {  
            tr = other.tr;
        }  
        return *this;  
    }

    void pushup(int u) { tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum; }
    void pushdown(Node& u, Node& l, Node& r) {
        l.flag = (l.flag + u.flag) % mod, r.flag = (r.flag + u.flag) % mod;
        l.sum = (l.sum + u.flag * (l.r - l.l + 1)) % mod, r.sum = (r.sum + u.flag * (r.r - r.l + 1)) % mod;
        u.flag = 0;
    }
    void pushdown(int u) { if (tr[u].flag) pushdown(tr[u], tr[u << 1], tr[u << 1 | 1]); }

    void build(int u, int l, int r) {
        tr[u] = {l, r};
        if (l == r) return;
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }

    ll query(int u, int l, int r) {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        ll res = 0;
        if (l <= mid) res += query(u << 1, l, r);
        if (r > mid) res += query(u << 1 | 1, l, r);
        return res;
    }

    void modify(int u, int l, int r, ll v) {
        if (tr[u].l >= l && tr[u].r <= r) tr[u].flag = (tr[u].flag + v) % mod, tr[u].sum = (tr[u].sum + (tr[u].r - tr[u].l + 1) * v) % mod;
        else {
            pushdown(u);
            int mid = tr[u].l + tr[u].r >> 1;
            if (l <= mid) modify(u << 1, l, r, v);
            if (r > mid) modify(u << 1 | 1, l, r, v);
            pushup(u);
        }
    }
};

void solve() {
    scanf("%d%d%d", &n, &mod, &m);
    vector<ST> tr;
    for (int i = 0; i <= 100; i++) tr.emplace_back(ST(1, n));
    f[0][0] = 1;
    for (int i = 1; i <= 100; i++)
        for (int j = 0; j <= i; j++)
            f[i][j] = j ? (f[i - 1][j] + f[i - 1][j - 1]) % mod : 1;
    while (m--) {
        int l, p, r, d;
        ll c;
        scanf("%d%d%d%lld%d", &l, &p, &r, &c, &d);
        c %= mod;
        ll v = 1;
        for (int i = d; ~i; i--) {
            tr[i].modify(1, l, r, v * f[d][i] % mod);
            v = v * c % mod;
        }
        ll res = 0, t = 1;
        for (int i = 0; i <= 100; i++) {
            res = (res + tr[i].query(1, p, p) * t) % mod;
            t = t * p % mod;
        }
        printf("%lld\n", res);
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}