#include<bits/stdc++.h>
//#define int unsigned long long 
using namespace std;
unsigned long long a[55][2];
unsigned long long b[30];
unsigned long long m,n,gcdd=1;

unsigned long long gcd(unsigned long long x,unsigned long long y){
	if(y==0)return x;
	else gcd(y,x%y);
}
int main(){
	freopen("fenshu.in","r",stdin);
	freopen("fenshu.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i][0];
		cin>>a[i][1];
	}
	for(int i=1;i<=m;i++){
		cin>>b[i];
	}
	for(int i=1;i<=n;i++){
		gcdd=a[i][1]*gcdd/gcd(a[i][1],gcdd);
		//cout<<1;
	}
	for(int i=1;i<=m;i++){
		gcdd=b[i]*gcdd/gcd(b[i],gcdd);
		
	}
	a[n+1][1]=gcdd;
	for(int i=1;i<=n;i++){
		a[i][0]=a[i][0]*gcdd/a[i][1];
		a[i][1]=gcdd;
		
		a[n+1][0]+=a[i][0];
	//	cout<<a[i][0]<<endl;
	}
	//cout<<a[n+1][0]<<" "<<a[n+1][1]<<endl;
	for(int i=1;i<=m;i++){
		if(a[n+1][0]%b[i]==0)a[n+1][0]/=b[i];
		else a[n+1][1]*=b[i];
		
	}
	if(a[n+1][0]>=a[n+1][1]&&a[n+1][0]%a[n+1][1]==0)cout<<a[n+1][0]/a[n+1][1];
	else {
		gcdd=gcd(a[n+1][0],a[n+1][1]);
		cout<<a[n+1][0]/gcdd<<" "<<a[n+1][1]/gcdd;
	}
	return 0;
}