515B - Drazil and His Happy Friends - CodeForces Solution

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

#define nl "\n"
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define al(x) x.begin(), x.end()
#define Test int t;cin>>t;while(t--)
#define rep(i,n) for(ll i=0;i<n;i++)
#define mpp map<ll,ll>
#define vi(type) vector<type>
#define vv  vector<vector<ll>>
#define vp vector<pair<ll,ll>>
#define uq(a) (a).erase(unique((a).begin(),(a).end()),(a).end())

ll dx[4]={-1,0,1,0};
ll dy[4]={0,1,0,-1};
  
void fast()
{
   ios_base::sync_with_stdio(0);
   cin.tie(0);
   cout.tie(0);
} 

void solve(){
  ll n,m; cin>>n>>m;
  vi(ll) a(n),b(m);
  mpp mpa,mpb;
  ll by; cin>>by;
  rep(i,by) {
    cin>>a[i];
    mpa[a[i]]=1;
  }
  ll gy; cin>>gy;
  rep(i,gy) {
    cin>>b[i];
    mpb[b[i]]=1;
  }

  for(ll i=0;i<10000;i++){
    if(mpa[i%n] || mpb[i%m]){
      mpa[i%n]=1;
      mpb[i%m]=1;
    }
  }

  ll fl1=0,fl2=0;
  rep(i,n){
    if(mpa[i]) fl1++;
  }
  rep(i,m){
    if(mpb[i]) fl2++;
  }
  // cout<<fl1<<" "<<fl2;
  if(fl1==n && fl2==m) cout<<"YES\n";
  else cout<<"NO\n";
}

int main()
{
    fast();  
    solve();
    // Test
    // {    
    //     solve();
    // }
    return 0;
}