#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod=1e9+7;
ll n,m,q,a[200005],z,y,k,qz[200005],cnt[200005],p[200005];
int main(){
    freopen("Subsequence.in","r",stdin);
    freopen("Subsequence.out","w",stdout);
    p[0]=1;
    cin>>n>>m>>q;
    for(int i=1;i<=n+1;++i)
        p[i]=p[i-1]*2%mod;
    while(m--){
        cin>>z>>y;
        a[z]++;a[y+1]--;
    }
    for(int i=1;i<=n;++i)
        a[i]+=a[i-1];
    for(int i=1;i<=n;++i)
        a[i]&=1;
    for(int i=1;i<=n;++i)
        qz[i]=(qz[i-1]*2+a[i])%mod;
    for(int i=1;i<=n;++i)
        cnt[i]=cnt[i-1]+a[i];
    while(q--){
        cin>>z>>y>>k;
        if(cnt[y]-cnt[z-1]>=k){
            cout<<p[k]-1<<'\n';
            continue;
        }
        ll l=z-1,r=y;
        while(l<r){
            ll mid=(l+r+1)/2;
            if(y-mid+cnt[mid]-cnt[z-1]>=k)l=mid;
            else r=mid-1;
        }
        ll c=cnt[l]-cnt[z-1];
        ll part1=(p[c]-1+mod)%mod*p[y-l]%mod;
        ll part2=(qz[y]-qz[l]*p[y-l]%mod+mod)%mod;
        cout<<(part1+part2)%mod<<'\n';
    }
    return 0;
}