#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
#define piii tuple<int,int,int>
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define int long long
int n,m,a[20010],d[200010];
int dfs(int l,int r,int k){
	if(l>r)return 0;
	if(k>m)return accumulate(a+l,a+r+1,0ll);
	int mid=partition(a+l,a+r+1,
		[&](int x){return x%d[k]==0;})-a-1;
	return k&1?min(dfs(l,mid,k+1),dfs(mid+1,r,k+1))
			  :max(dfs(l,mid,k+1),dfs(mid+1,r,k+1));
}
void work(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++)cin>>d[i];
	if(m>__lg(n)*2)cout<<"0\n";
	else cout<<dfs(1,n,1)<<'\n';
}
signed main(){
	ios::sync_with_stdio(0),
	cin.tie(0),cout.tie(0);
	int T=1;while(T--)work();return 0;
}