#include <bits/stdc++.h>
using namespace std;

typedef long long db;
const db eps=0;
int sign(db k){
	if (k>eps) return 1;
	else if (k<-eps) return -1;
	return 0;
}
int cmp(db k1,db k2){
	return sign(k1-k2);
}
int inmid(db k1,db k2,db k3){
	return sign(k1-k3)*sign(k2-k3)<=0;
}
 
struct point{
	db x,y;
	point operator + (const point &k1){return (point){x+k1.x,y+k1.y};}
	point operator - (const point &k1){return (point){x-k1.x,y-k1.y};}
	point operator * (db k1){return (point){x*k1,y*k1};}
	point operator / (db k1){return (point){x/k1,y/k1};}
	
	int operator == (const point &k1){
		return cmp(x,k1.x)==0 && cmp(y,k1.y)==0;
	}
	
	db abs(){return hypot(x,y);}
	db abs2(){return x*x+y*y;}
	db dis(point k1){return ((*this)-k1).abs();}
	
	int getP() const{
		return sign(y)==-1||(sign(y)==0&&sign(x)==-1);
	}
	
	inline void read(){
		int a,b;
		cin >> a >> b;
		x=a;y=b;
	}
	inline void display(){
		cerr << "(" << x << "," << y << ") ";
	}
};
 
int inmid(point k1,point k2,point k3){
	return inmid(k1.x,k2.x,k3.x) && inmid(k1.y,k2.y,k3.y);
}
db cross(point k1,point k2){return k1.x*k2.y-k1.y*k2.x;}
db dot(point k1,point k2){return k1.x*k2.x+k1.y*k2.y;}

bool left(point k1,point k2,point q){
	return sign(cross(k2-k1,q-k1))>=0;
}
bool on(point k1,point k2,point q){
	return sign(cross(k2-k1,q-k1))==0 && inmid(k1,k2,q);
}
int compareangle(point k1,point k2){
	return k1.getP()<k2.getP()||(k1.getP()==k2.getP()&&sign(cross(k1,k2))>0);
}


typedef long long ll;
const ll mod=998244353;
inline ll ksm(ll a,ll x){
	ll ret=1;
	for (;x;x>>=1,a=a*a % mod) if (x&1) ret=ret*a%mod;
	return ret;
}
inline ll inv(ll a){
	return ksm(a,mod-2);
}

const int maxn=500;
ll n,m;
ll p;
point b[maxn+50];
point a[maxn+50];
bool ok[maxn+50][maxn+50];
ll cost[maxn+50][maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> m >> n >> p;
	
	p=p*inv(100) % mod;
	
	for (int i=1;i<=m;i++) b[i].read();
	for (int i=1;i<=n;i++) a[i].read();
	
	sort(a+1,a+n+1,
		[&](const point &A,const point &B){
			return (A.y==B.y)?(A.x<B.x):(A.y<B.y);
		}
	);
	/*
	cerr << "-------------" << endl;
	for (int i=1;i<=n;i++) a[i].display();
	cerr << endl;
	*/
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			if (i==j) continue;
			bool flag=1;
			for (int k=1;k<=m;k++){
				if (!left(a[i],a[j],b[k])){
					flag=0;
					break;
				}
				else if (sign(cross(a[j]-a[i],b[k]-a[i]))==0 && !inmid(a[i],a[j],b[k])){
					flag=0;
					break;
				}
			}
			if (!flag) continue;
			ok[i][j]=1;
			
			cost[i][j]=1.0;
			if (a[j].y<a[i].y){
				for (int k=1;k<=n;k++){
					if (a[j].y<a[k].y && a[k].y<=a[i].y && left(a[i],a[j],a[k]))
						(cost[i][j]*=inv(mod+1-p))%=mod;
				}
			}
			else if (a[j].y>a[i].y){
				for (int k=1;k<=n;k++){
					if (a[i].y<a[k].y && a[k].y<=a[j].y && !left(a[i],a[j],a[k]))
						(cost[i][j]*=mod+1-p)%=mod;
				}
			}
			else if (a[i].x<a[j].x){
				for (int k=1;k<=n;k++){
					if (on(a[i],a[j],a[k]) && k!=i)
						(cost[i][j]*=inv(mod+1-p))%=mod;
				}
			}
		}
	}
	/*
	cerr << "-----------------" << endl;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			cerr << ok[i][j] << " ";
		}
		cerr << endl;
	}
	cerr << endl;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			cerr << cost[i][j] << " ";
		}
		cerr << endl;
	}
	*/
	vector<pair<int,int>> preList;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			if (i==j) continue;
			if (!ok[i][j]) continue;
			preList.emplace_back(i,j);
		}
	}
	sort(preList.begin(),preList.end(),
		[&](const pair<int,int> &A,const pair<int,int> &B){
			point va=a[A.second]-a[A.first];
			point vb=a[B.second]-a[B.first];
			if (sign(cross(va,vb))==0 && sign(dot(va,vb))>0){
				if (sign(dot(a[A.second]-a[B.second],va))>0) return 1;
				return 0;
			}
			return compareangle(va,vb);
		}
	);
	ll ans=0;
	for (int sel=1;sel<=n;sel++){
		vector<ll> dp(n+5);
		for (auto [i,j]:preList){
			if (i>=sel && j>=sel){
			//	cerr << "i , j : " << i << " " << j << endl;
				ll src=inv(mod+1-p);
				if (i!=sel) src=dp[i];
				dp[j]=(dp[j]+src*cost[i][j]%mod*p)%mod;
				/*
				cerr << "dp : ";
				for (int i=1;i<=n;i++) cerr << dp[i]*64%mod << " ";
				cerr << endl;
				*/
			}
		}
		ll res=dp[sel];
		res=ksm(mod+1-p,n)*res%mod;
	
		ans=(ans+res)%mod;
	}
	cout << ans << "\n";
	return 0;
}