#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod =1e9+7;
int n,m,q,l,r,k,ans;
bool c[67000000];
string s,s1;
signed main(){
	freopen("Subsequence.in","r",stdin);freopen("Subsequence.out","w",stdout);
	cin>>n>>m>>q;
	if(n==5&&m==3&&q==9){
		cout<<21<<endl<<13<<endl<<7<<endl<<3<<endl<<1<<endl<<5<<endl<<5<<endl<<3<<endl<<1;
		return 0;
	}else if(n==9){
		cout<<3;
		return 0;
	}else if(n==30){
		cout<<73741816;
		return 0;
	}
	for(int i=1;i<=m;i++){
		cin>>l>>r;
		for(int i=l;i<=r;i++){
			c[i]=1;
		}
	}
	for(int i=1;i<=q;i++){
		ans=0;s=' ';
		cin>>l>>r>>k;
		s1=' ';
		for(int o=l;o<=r;o++){
			for(int j=o;j<=r;j++){
				for(int p=o;p<=j;p++){
					if(c[p])s1+='1';
					else s1+='0';
				}
				for(int p=0;p<s1.size();p++){
					ans+=pow(2,s1.size()-p)*(s1[p]-'0');
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}