#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn =3e5+10;
const int INF=0x3f3f3f3f;
ll gcd(ll a,ll b)
{
return b==0?a:gcd(b,a%b);
}
int n,m;ll a[maxn];
ll x[maxn],p[maxn];
int main(int argc, char const *argv[])
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
{
scanf("%lld",&x[i]);
a[i]=x[i];
}
ll ans=x[1]-x[0];
for(int i=2;i<n;i++)
{
ll x=a[i]-a[i-1];
ans=gcd(ans,x);
}
for(int i=1;i<=m;i++)
{
cin>>p[i];
}
for(int i=1;i<=m;i++)
{
if(ans%p[i]==0)
{
cout<<"YES"<<endl;
cout<<a[0]<<" "<<i<<endl;
return 0;
}
}
cout<<"NO"<<endl;
return 0;
}
Educational Codeforces Round 63 (Rated for Div. 2) C
猜你喜欢
转载自blog.csdn.net/wzazzy/article/details/89679928
今日推荐
周排行