#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint;

template<class T, T op(T, T), T e()>
struct seg2{
    int size;
    vector<T> seg;
    seg2(int n){
        size = 1;
        while (size < n) size *= 2;
        seg.resize(size * 2);
    }
    void add(int l, int r, T v){
        l += size, r += size;
        while (l < r){
            if (l & 1){
                seg[l] = op(seg[l], v);
                l++;
            }
            if (r & 1){
                r--;
                seg[r] = op(seg[r], v);
            }
            l /= 2, r /= 2;
        }
    }
    T get(int a){
        T res = e();
        a += size;
        while (a){
            res = op(res, seg[a]);
            a /= 2;
        }
        return res;
    }
};

mint op(mint a, mint b){
    return a + b;
}
mint e(){
    return 0;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, B, Q;
    cin >> N >> B >> Q;
    mint::set_mod(B);
    const int L = 101;
    vector C(L, vector<mint>(L));
    C[0][0] = 1;
    rep(i, 1, L){
        rep(j, 0, i){
            C[i][j] += C[i - 1][j];
            C[i][j + 1] += C[i - 1][j];
        }
    }
    vector<seg2<mint, op, e>> seg(L, N);
    rep(i, 0, Q){
        int l, m, r;
        ll c;
        int d;
        cin >> l >> m >> r;
        cin >> c >> d;
        l--, m--;
        mint tmp = 1;
        rep(j, 0, d + 1){
            seg[d - j].add(l, r, C[d][j] * tmp);
            tmp *= c;
        }
        mint ans = 0;
        tmp = 1;
        rep(j, 0, L){
            ans += tmp * seg[j].get(m);
            tmp *= m + 1;
        }
        cout << ans.val() << "\n";
    }
}