#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************


int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b, a%b);
}


vector<int> a;
vector<int> b;

vector<int> consistency(int m, int n){

    int gc = 0;
    for(int i=1; i<m; i++) gc = gcd(gc, abs(a[i]-a[i-1]));

    vector<int> ans(n);
    for(int j=0; j<n; j++){
        ans[j] = gcd(a[0] + b[j], gc);
    }

    return ans;
}















vector<int> practice(int m, int n){


}





void solve() {
    
    int m, n;
    cin>> m >> n;
    
    a.resize(m);
    for(int i=0; i<m; i++) cin >> a[i];

    b.resize(n);
    for(int i=0; i<n; i++) cin >> b[i];
    
    auto ans = consistency(m, n);

    for(auto& t : ans) cout << t << " "; cout << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}