#include <iostream>
#include <vector>

int qthDivisible(std::vector<int>& A, int rank){
    int i = 0;
    int num = 0;
    while(i < rank){
        for(int j = 0; j < A.size(); j++){
            if(num % A.at(j) == 0){
                i++;
                break;
            }
        }
        num++;
    }
    return num+1;
}

int main(){
    int N, M;
    std::vector <int>A;
    std::vector <int>Q;
    std::cout << "Enter N, M: ";
    std::cin >> N >> M;
    std::cout << "Enter N integers: ";
    int temp = -1;
    for(int i = 0; i < N; i++){
        std::cin >> temp;
        A.push_back(temp);
    }       
    std::cout << "Enter Q integers: ";
    for(int i = 0; i < M; i++){
        std::cin >> temp;
        Q.push_back(temp);
    }
    std::cout << "\n\n";

    for(int i = 0; i < Q.size(); i++){ //go thru every Q
        int solution = qthDivisible(A, Q.at(i));
        std::cout << solution << std::endl;
    }

}