#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int a[N];
int ans[N];
int main()
{
	int n , m , k;
	cin >> n >> m >> k;
	for(int i = 1 ; i <= n ; i++)
	{
		cin >> a[i];
		ans[i] = a[i] - a[i-1];
	}
	

	while(m--)
	{
		int l,r,num;
		cin >> l >> r >> num;
		ans[l]+= num;
		ans[r+1] -= num;
	}
	for(int i = 1 ; i <= n ; i++)
		ans[i] += ans[i-1];
	for(int i = 1 ; i <= n ; i++)
		ans[i] += ans[i-1];
	while(k--)
	{
		int l , r;
		cin >> l >> r;
		cout << ans[r] - ans[l-1] << endl;
	}
	return 0; 
}