#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  long long a[300005], p[300005];
  long long n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < m; i++) cin >> p[i];
  long long g = 0;
  for (int i = 1; i < n; i++) {
    g = gcd(g, a[i] - a[i - 1]);
  }
  for (int i = 0; i < m; i++) {
    if (g % p[i] == 0) {
      cout << "YES" << endl;
      cout << a[0] << " " << i + 1 << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
