#include<bits/stdc++.h>
using namespace std;
const int N=500005;
int n,m,q;
long double dist[N];
long double deg[N];
inline pair<long double,long double>getdot(long double dis,long double deg){
	return make_pair(cosl(deg)*dis,sinl(deg)*dis);
}
void work(){
	long double ans=1e100;
	int x,y;
	cin>>x>>y;
	vector<long double>Di,De;
	int it=lower_bound(dist+1,dist+n+1,hypotl(x,y))-dist;
	if(it>1)Di.emplace_back(dist[it-1]);
	if(it>2)Di.emplace_back(dist[it-2]);
	if(it+1<=n)Di.emplace_back(dist[it+1]);
	if(it+2<=n)Di.emplace_back(dist[it+2]);
	Di.emplace_back(dist[it]);
	Di.emplace_back(dist[1]);
	Di.emplace_back(dist[2]);
	it=lower_bound(deg+1,deg+m+1,atan2l(y,x))-deg;
	if(it>m)it=1;
	De.emplace_back(deg[it]);
	De.emplace_back(deg[it==1?m:it-1]);
	for(int i=-3;i<=3;i++){
		De.emplace_back(deg[(it+i+m)%m+1]);
	}
	for(auto d:Di)
	for(auto g:De){
		auto res=getdot(d,g);
		ans=min(ans,hypotl(res.first-x,res.second-y));
	}
	cout<<ans<<'\n';
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cout<<fixed<<setprecision(11);
	cin>>n>>m>>q;
	for(int i=1;i<=n;++i)
	cin>>dist[i];
	dist[++n]=1e8;
	sort(dist+1,dist+n+1);
	for(int i=1;i<=m;++i){
		int x,y;
		cin>>x>>y;
		deg[i]=atan2l(y,x);
	}
	sort(deg+1,deg+m+1);
	for(;q--;)work();
	return 0;
}