#include<stdio.h>
#include<bits/stdc++.h>
#define fir first
#define sec second
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef __int128 int128;
typedef __uint128_t uint128;
typedef pair<int,int> pii;
template<typename type>
inline void chmin(type &x,const type &y)
{
	if(y<x)
		x=y;
}
template<typename type>
inline void chmax(type &x,const type &y)
{
	if(x<y)
		x=y;
}
constexpr int Max=5e5+10;
struct block_array1//O(1) modify
{
	static constexpr int block=707,Size=Max/block+2;
	ll s1[Max],s2[Size];
	inline void add(const uint &x,const ll &k)
	{
//		cerr<<"add "<<x<<" : "<<k<<"\n";
		s1[x]+=k,s2[x/block]+=k;
	}
	inline ll ask(const int &x)const
	{
		const int p=x/block,rb=min((p+1)*block,Max);
		ll ans=0;
		for(int i=x;i<rb;++i)
			ans+=s1[i];
		for(int i=p+1;i<Size;++i)
			ans+=s2[i];
//		cerr<<"ask "<<x<<" : "<<ans<<"\n";
		return ans;
	}
	inline void clear()
	{
		memset(s1,0,sizeof(s1));
		memset(s2,0,sizeof(s2));
	}
}t;
struct block_array2//O(1) query
{
	static constexpr int block=707,Size=Max/block+2;
	ll s1[Max+block+1],s2[Size];
	inline void add(const int &x,const ll &k)
	{
		const int p=x/block;
		for(int i=p*block;i<=x;++i)
			s1[i]+=k;
		for(int i=0;i<=p;++i)
			s2[i]+=k;
	}
	inline ll ask(const int &x)const
	{
		const int p=x/block;
		return s1[x]+(p+1<Size?s2[p+1]:0);
	}
	inline void clear()
	{
		memset(s1,0,sizeof(s1));
		memset(s2,0,sizeof(s2));
	}
}t0,t1;
constexpr int block_cnt=Max;
int n,m,q_cnt;
vector<pii>Q[Max];
int block,tot;
int lpos[block_cnt],rpos[block_cnt],bel[Max];
void init_block()
{
	block=min(n,4000);
	tot=(n+block-1)/block;
	for(int i=1;i<=tot;++i)
		lpos[i]=rpos[i-1]+1,rpos[i]=rpos[i-1]+block;
	rpos[tot]=n;
	for(int i=1;i<=tot;++i)
		for(int j=lpos[i];j<=rpos[i];++j)
			bel[j]=i;
//	cerr<<"block : ";
//	for(int i=1;i<=tot;++i)
//		cerr<<"["<<lpos[i]<<","<<rpos[i]<<"] ";
//	cerr<<"\n";
}
int opt[Max],a[Max],b[Max],c[Max];
int pos[Max],num[Max];
int id[block_cnt],tag[block_cnt];
ll ans[Max];
signed main()
{
	freopen("mfsn.in","r",stdin);
	freopen("mfsn.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>n>>m>>q_cnt;
	init_block();
	for(int i=1;i<=m;++i)
	{
		cin>>opt[i]>>a[i]>>b[i];
		if(opt[i]==1)
			cin>>c[i];
	}
	for(int i=1,l,r;i<=q_cnt;++i)
		cin>>l>>r,Q[r].emplace_back(l,i);
	for(int o=1;o<=m;++o)
	{
		const int l=a[o],r=b[o];
		const int p=bel[l],q=bel[r];
		auto push_down=[&](const int &u)->void
		{
			if(tag[u])
			{
				const int x=tag[u],y=id[u];
				const int lb=lpos[u],rb=rpos[u];
				for(int i=lb;i<=rb;++i)
					num[i]=x,pos[i]=y;
				tag[u]=0;
			}
		};
		auto update_block=[&](const int &u,int l,int r,const int &k)->void
		{
			const int lb=lpos[u],rb=rpos[u];
			if(l<=lb&&r>=rb)
				tag[u]=k,id[u]=o;
			else
			{
				chmax(l,lb),chmin(r,rb);
				if(l>r)
					return;
				push_down(u);
				for(int i=l;i<=r;++i)
					num[i]=k,pos[i]=o;
			}
		};
		auto query_block=[&](const int &u,int l,int r)->void
		{
			const int lb=lpos[u],rb=rpos[u];
			if(l<=lb&&r>=rb)
			{
				if(tag[u])
					t.add(id[u],(ll)(rb-lb+1)*tag[u]);
			}
			else
			{
				chmax(l,lb),chmin(r,rb);
				if(l>r)
					return;
				if(tag[u])
					t.add(id[u],(ll)(r-l+1)*tag[u]);
				else
					for(int i=l;i<=r;++i)
						t.add(pos[i],num[i]);
			}
		};
		if(opt[o]==1)
			for(int i=p;i<=q;++i)
				update_block(i,l,r,c[o]);
		else
			for(int i=p;i<=q;++i)
				query_block(i,l,r);
		for(auto [x,id]:Q[o])
			ans[id]+=t.ask(x);
	}
	memset(pos,0,sizeof(pos));
	memset(num,0,sizeof(num));
	for(int z=1;z<=tot;++z)
	{
		const int lb=lpos[z],rb=rpos[z];
		int cnt=0,tag=0,id=0;
		for(int o=1;o<=m;++o)
		{
			if(opt[o]==2)
			{
				if(a[o]<=lb&&b[o]>=rb)
					++cnt;
			}
			else
			{
				int l=max(a[o],lb),r=min(b[o],rb);
				const int w=c[o];
				if(l<=r)
				{
					auto clear=[&](int l,int r)->void
					{
						for(int i=l,j;i<=r;i=j+1)
						{
							j=i;
							const int x=pos[i];
							while(j<r&&pos[j+1]==x)
								++j;
							if(x)
							{
								t1.add(x,-(ll)(j-i+1)*num[i]);
								t0.add(x,(ll)(j-i+1)*num[i]*cnt);
							}
							for(int k=i;k<=j;++k)
								pos[k]=0;
						}
					};
					if(tag&&(l>lb||r<rb))
					{
						clear(lb,rb);
						for(int i=lb;i<=rb;++i)
							num[i]=tag,pos[i]=id;
						t1.add(id,(ll)(rb-lb+1)*tag);
						t0.add(id,-(ll)(rb-lb+1)*tag*cnt);
						tag=0;
					}
					if(!tag)
						clear(l,r);
					if(l==lb&&r==rb)
						tag=w,id=o;
					else
					{
						tag=0;
						for(int i=l;i<=r;++i)
							num[i]=w,pos[i]=o;
						t1.add(o,(ll)(r-l+1)*w);
						t0.add(o,-(ll)(r-l+1)*w*cnt);
					}
				}
			}
			for(auto [x,id]:Q[o])
				ans[id]+=t0.ask(x)+cnt*t1.ask(x);
		}
		t0.clear(),t1.clear();
	}
	for(int i=1;i<=q_cnt;++i)
		cout<<ans[i]<<"\n";
	return 0;
}