#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define mod 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int>PII;
inline LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
const int N = 200010;
int n, m;
LL a[N], b[N];
void solve() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  for (int i = 1; i <= m; ++i) scanf("%lld", &b[i]);
  LL res = 0;
  for (int i = 2; i <= n; ++i) {
    res = gcd(res, a[i] - a[i - 1]);
  }
  for (int j = 1; j <= m; ++j) {
    cout << abs(gcd(res, a[1] + b[j])) << " ";
  }
  cout << endl;
}
int main() {
  //int t; cin >> t;
  //while (t--)
    solve();
  return 0;
}