#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N,M;
    cin>>N>>M;
    vector<ll> A(N),B(N);
    rep(i,0,N) cin>>A[i]>>B[i];
    ll Q,X;
    cin>>Q>>X;
    vector<ll> C(N);
    rep(i,0,N) cin>>C[i];
    auto g=[&](int ind,ll l,ll r) -> ll {
        return (r-l)*(A[ind]*2+B[ind]*l+B[ind]*(r-1))/2;
    };
    auto f=[&](int ind,ll R) -> ll {
        if(B[ind]==0) return M*abs(R-A[ind]);
        if(A[ind]>=R) return g(ind,0,M)-R*M;
        if(A[ind]+(M-1)*B[ind]<=R) return R*M-g(ind,0,M);
        ll z=1+(R-A[ind])/B[ind];
        return R*z-g(ind,0,z)-R*(M-z)+g(ind,z,M);
    };
    auto h=[&](int a,int b) -> ll {
        if(f(a,0)>f(b,0)) return -ILL;
        if(f(a,INF)<=f(b,INF)) return ILL;
        ll l=0,r=INF;
        while(r-l>1){
            ll m=(l+r)/2;
            if(f(a,m)<=f(b,m)) l=m;
            else r=m;
        }
        return r;
    };
    vector<int> order(N);
    int k=0;
    rep(i,0,N){
        while(k>=2){
            int a=order[k-2],b=order[k-1];
            if(h(a,b)>=h(b,i)) k--;
            else break;
        }
        order[k++]=i;
    }
    order.resize(k);
    k=0;
    rep(rp,0,Q){
        while(k+1!=(int)(order.size())){
            if(f(order[k],X)<=f(order[k+1],X)) break;
            k++;
        }
        if(rp) cout<<" ";
        cout<<order[k]+1;
        X+=C[order[k]];
    }
    cout<<"\n";
}