#include<cstdio>
#include<iostream>
using namespace std;

int yuefenz(int a,int b){
	int chua=a,chub=b,yushu;
	while(1){
		yushu=a%b;
		if(yushu==0) break;
		a=b;
		b=yushu;
	}
	int ans1=chua/b;
	int ans2=chub/b;
	return ans1;
}

int yuefenm(int a,int b){
	int chua=a,chub=b,yushu;
	while(1){
		yushu=a%b;
		if(yushu==0) break;
		a=b;
		b=yushu;
	}
	int ans1=chua/b;
	int ans2=chub/b;
	return ans2;
}

int fenzi(int a,int b,int c,int d){
	return a*d+b*c;
}

int fenmu(int b,int d){
	return b*d;
}

int chufa(int b,int x){
	return b*x;
}

int main(){
	freopen("fenshu.in","r",stdin);
	freopen("fenshu.out","w",stdout);
	int n,m;
	int fs[105][3],intt[105];
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&fs[i][1],&fs[i][2]);
	}
	for(int i=1;i<=m;i++){
		scanf("%d",&intt[i]);
	}
	for(int i=1;i<=n-1;i++){
		int fz,fm;
		fz=fenzi(fs[i][1],fs[i][2],fs[i+1][1],fs[i+1][2]);
		fm=fenmu(fs[i][2],fs[i+1][2]);
		fs[i+1][1]=fz;
		fs[i+1][2]=fm;
	}
	for(int i=1;i<=m;i++){
		fs[n+i-1][2]=chufa(fs[n+i-1][2],intt[i]);
	}
	int ans1=yuefenz(fs[n+m-1][1],fs[n+m-1][2]);
	int ans2=yuefenm(fs[n+m-1][1],fs[n+m-1][2]);
	if(ans1==ans2) printf("1");
	else printf("%d %d",ans1,ans2); 
	return 0;
}