0pts求调

#include <iostream>
#include <algorithm>
#include <cstring>
#define Please return
#define AC 0
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
using namespace std;
const int MAXN = 1e3 + 5;
int n, q, a, b, box[MAXN], ans;

int gcd(int x, int y) {
	while (y) {
		int yu = x % y;
		x = y;
		y = yu;
	}
	return x;
}

int main() {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		cin >> a;
		if (i == 1) {
			b = a;
		}
		box[a]++;
	}
	for (int i = 1; i <= q; i++) {
		ans = b;
		for (int j = 2; j <= MAXN; j++) {
			if (box[j]) {
				ans = gcd(ans, j + i);
			}
		}
		cout << ans << endl;
	}
	Please AC;
}