https://codeforces.com/contest/1155/problem/C

题解：

1、对x数组求差；

2、对x数组差求GCD；

3、暴力查找p数组有没有GCD%pi==0;

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=300000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
ll ans,cnt,flag,temp,sum;
ll a[N],b[N],c[N];
char str;
struct node{

};
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    //scanf("%d",&t);
    //while(t--){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%I64d",&a[i]);
    }
    for(int i=1;i<=m;i++){
        scanf("%I64d",&b[i]);
    }
    for(int i=1;i<n;i++){
        c[i]=a[i+1]-a[i];
    }
    ans=c[1];
    for(int i=2;i<n;i++){
        ans=__gcd(c[i],ans);
    }
    //cout<<ans<<endl;
    //int pos=lower_bound(b+1,b+m+1,k)-b;
    for(int i=1;i<=m;i++){
        if(ans==b[i]||ans%b[i]==0){
            cout<<"YES"<<endl;
            cout<<a[1]<<" "<<i<<endl;
            return 0;
        }
    }
    cout<<"NO"<<endl;
    //}

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}