import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T read(T)(){ return read.to!T; }
T[] read(T)(long n){ return n.iota.map!(_ => read!T).array; }
T[][] read(T)(long m, long n){ return m.iota.map!(_ => read!T(n)).array; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

/*

Find gcd of given minutes.
If any p is divisor of the gcd, then YES.
Otherwise NO.

*/

void solve(){
	int n = read!int;
	int m = read!int;
	long[] xs = read!long(n);
	long[] ps = read!long(m);
	
	long d = xs[1] - xs[0];
	foreach(i; 0 .. n - 1) d = gcd(d, xs[i + 1] - xs[i]);
	
	bool f;
	int ans;
	foreach(int j, p; ps) if(d % p == 0) f = 1, ans = j;
	
	if(! f) writeln("NO");
	else writeln("YES"), writeln(xs[0], " ", ans + 1);
}

long gcd(long a, long b){
	if(a % b == 0) return b;
	if(a < b) return gcd(b, a);
	else return gcd(b, a % b);
}
