#include<bits/stdc++.h>
using namespace std;

const int MAXN = 1000001;
int seq[MAXN];
long long pre[MAXN];

int main() {
    int N, K;
    cin >> N >> K;
    
    for (int i = 0; i < K; ++i) {
        int X;
        cin >> X;
        for (int j = 0; j < N; j += X) {
            ++seq[j];
        }
    }

    pre[0] = 0;
    for (int i = 1; i <= N; ++i) {
        pre[i] = pre[i-1] + seq[i-1];
    }
    
    int Q;
    cin >> Q;
    while (Q--) {
        int L, R;
        cin >> L >> R;
        cout << pre[R+1] - pre[L] << endl;
    }
    
    return 0;
}