#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N;cin>>N;
    vl S(N);
    for(int i=0;i<N;i++){
        cin>>S[i];
    }
    int Q;cin>>Q;
    vl T;
    ll now=0,len=0;
    for(int i=0;i<Q;i++){
        ll a,b;cin>>a>>b;
        if(now>=a){
            now+=b;
            len+=b;
        }else{
            if(len) T.pb(len);
            now=a+b;
            len=b;
        }
    }
    if(len) T.pb(len);
    
    const int D=3000000;
    
    vector<ll> rui(D+1),BIG;
    for(ll x:T){
        if(x>D) BIG.pb(x);
        else rui[x]++;
    }
    for(int i=1;i<=D;i++) rui[i]+=rui[i-1];
    
    map<ll,ll> MA;
    
    for(int i=0;i<N;i++){
        ll x=S[i];
        if(MA.count(x)){
            cout<<MA[x]<<"\n";
            continue;
        }
        ll ans=0;
        for(ll t:BIG){
            ans+=t/x;
        }
        
        for(ll s=1;s*x<=D;s++){
            ll l=s*x,r=min((ll)D,(s+1)*x-1);l--;
            ans+=(rui[r]-rui[l])*s;
        }
        MA[x]=ans;
        cout<<ans<<"\n";
    }
}