#include<bits/stdc++.h>
#define int long long
using namespace std;
void ts(){cout<<"IAKIOI\n";}
inline int read(){
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int n,m,q;
int a[200005],b[200005];
vector<int> fac[200005];
vector<pair<int,int>> que[200005];
int ans[200005];
vector<int> vis[200005];
signed main(){
	n=read(),m=read(),q=read();
	for(int i=0;i<=n;i++)a[i]=read();
	for(int i=0;i<=n;i++)b[i]=read();
	for(int i=1;i<=m;i++){
		for(int j=i;j<=m;j+=i)fac[j].push_back(i);
	}
	for(int i=1;i<=q;i++){
		int c=read(),d=read();
		que[c].push_back({d,i});
	}
	for(int c=1;c<=m;c++){
		for(int j=0;j<(int)que[c].size();j++){
			vis[que[c][j].first].push_back(que[c][j].second);
		}
		for(int i=0;i*c<=m;i++){
			int p=m-i*c;
			if(!p){
				for(int j=0;j<(int)que[c].size();j++){
					ans[que[c][j].second]+=a[i]*b[0];
				}
				continue;
			}
			for(auto d:fac[p]){
				for(auto qid:vis[d]){
					ans[qid]+=a[i]*b[p/d];
				}
			}
		}
		for(int j=0;j<(int)que[c].size();j++){
			vis[que[c][j].first].clear();
		}
	}
	for(int i=1;i<=q;i++)printf("%lld\n",ans[i]);
	return 0;
}
//look at my code
//my code is amazing