#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  long long int temp;
  while (b > 0) {
    temp = b;
    b = a % b;
    a = temp;
  }
  return a;
}
int main() {
  long long int N, m;
  cin >> N >> m;
  long long int a[N], B[m];
  for (long long int i = 0; i < N; i++) {
    cin >> a[i];
  }
  long long int n = N - 1;
  long long int A[n];
  for (long long int i = 1; i < N; i++) {
    A[i - 1] = a[i] - a[i - 1];
  }
  for (long long int i = 0; i < m; i++) {
    cin >> B[i];
  }
  long long int result = A[0];
  for (long long int i = 1; i < n; i++) {
    result = gcd(result, A[i]);
  }
  long long int j = 0;
  while (j < m && result % B[j] != 0) {
    j++;
  }
  if (j < m) {
    cout << "YES" << endl;
    cout << a[0] << " " << j + 1 << endl;
  } else {
    cout << "NO" << endl;
  }
}
