#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
ll a[maxn],b[maxn];

ll gcd(ll n,ll m) {
    return m == 0 ? n : gcd(m,n % m);
}

int main() {
    int n,m;scanf("%d%d",&n,&m);
    for(int i = 1;i <= n;i++) {
        scanf("%lld",&a[i]);
    }
    for(int i = 1;i <= m;i++) {
        scanf("%lld",&b[i]);
    }
    if(n == 1) {
        for(int i = 1;i <= m;i++) {
            printf("%lld ",a[1] + b[i]);
        }
        return 0;
    }
    
    ll now = 0;
    for(int i = 2;i <= n;i++) {
        if(!now) now = abs(a[i] - a[i - 1]);
        else now = gcd(now,abs(a[i] - a[i - 1]));
    }
    
    for(int j = 1;j <= m;j++) {
        ll ans = gcd(now,a[n] + b[j]);
        printf("%lld ",ans);
    }
    return 0;
}