//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef int ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
bool assign_min(T& a, T b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

template<typename T>
T square(T a) {
	return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
	ll operator() (pair<ll, ll> p) const {
		return ((__int128)p.first * MOD + p.second) % INF64;
	}
};

ll gcd(ll a, ll b) {
	return (min(a, b) == 0 ? max(a, b) : gcd(max(a, b) % min(a, b), min(a, b)));
}

void solve() {
	ll n, q;
	cin >> n >> q;
	vector<ll> c(n);
	for (ll i = 0; i < n; i++) {
		cin >> c[i];
	}
	vector<vector<ll>> dn;
	map<ll, ll> to;
	for (ll i = 1; i <= n; i++) {
		if (n % i == 0) {
			vector<ll> now(i, INF32);
			for (ll j = 0; j < n; j++) {
				assign_min(now[j % i], c[j]);
			}
			to[i] = dn.size();
			dn.push_back(now);
		}
	}
	vector<ll> ans(dn.size(), INF32);
	ll nsum = 0;
	ll a = -1;
	for (ll i = 0; i < q; i++) {
		ll x;
		cin >> x;
		nsum += x;
		for (ll j = 0; j < dn.size(); j++) {
			assign_min(ans[j], dn[j][nsum % dn[j].size()]);
		}
		//cout << ans[to[gcd(n, nsum)]] << ' ';
		if (a == -1) {
			a = INF32;
			ll nn = 0;
			do {
				assign_min(a, c[nn]);
				nn += x;
				nn %= n;
			} while (nn != 0);
		}
		cout << a << ' ';
	}
	cout << '\n';
}

int main() {
	if (IS_FILE) {
		freopen("", "r", stdin);
		freopen("", "w", stdout);
	}
    	ios_base::sync_with_stdio(false);
    	cin.tie(0);
    	cout.tie(0);
	ll t = 1;
	if (IS_TEST_CASES) {
		cin >> t;
	}
	for (ll i = 0; i < t; i++) {
		solve();
	}
}