#include <bits/stdc++.h>

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, q;
    std::cin >> n >> q;
    std::vector<int> input(n);
    std::vector<int> shit(q);
    for (auto& i : input) {
        std::cin >> i;
    }
    for (auto& i : shit) {
        std::cin >> i;
    }

    std::vector<int> divs;
    for (int i = 1; i <= n; i++) {
        if (n % i == 0) {
            divs.push_back(i);
        }
    }
    int m = divs.size();
    std::vector<std::vector<int>> fuck(m);
    for (int i = 0; i < m; i++) {
        fuck[i].resize(divs[i]);
        for (int j = 0; j < divs[i]; j++) {
            int val = 1e9;
            for (int t = j; t < n; t += divs[i]) {
                val = std::min(val, input[t]);
            }
            fuck[i][j] = val;
        }
    }

    std::vector<int> table(m, 1e9);
    int sum = 0;
    for (int i = 0; i < q; i++) {
        for (int j = 0; j < m; j++) {
            table[j] = std::min(table[j], fuck[j][sum % divs[j]]);
        }
        sum = (sum + shit[i]) % n;
        int it = std::lower_bound(divs.begin(), divs.end(), std::gcd(n, sum)) - divs.begin();
        int ans = table[it];
        std::cout << ans << " \n"[i == q - 1];
    }

    return 0;
}