#line 2 "/home/kowerkoint/workspace/CompPro-Make/library/KowerKoint/stl-expansion.hpp" #include template std::istream& operator>>(std::istream& is, std::pair& p) { is >> p.first >> p.second; return is; } template std::istream& operator>>(std::istream& is, std::array& a) { for (size_t i = 0; i < N; ++i) { is >> a[i]; } return is; } template std::istream& operator>>(std::istream& is, std::vector& v) { for (auto& e : v) is >> e; return is; } template std::ostream& operator<<(std::ostream& os, const std::pair& p) { os << p.first << " " << p.second; return os; } template std::ostream& operator<<(std::ostream& os, const std::array& a) { for (size_t i = 0; i < N; ++i) { os << a[i] << (i + 1 == a.size() ? "" : " "); } return os; } template std::ostream& operator<<(std::ostream& os, const std::vector& v) { for (size_t i = 0; i < v.size(); ++i) { os << v[i] << (i + 1 == v.size() ? "" : " "); } return os; } #line 3 "/home/kowerkoint/workspace/CompPro-Make/library/KowerKoint/base.hpp" using namespace std; #define REP(i, n) for(int i = 0; i < (int)(n); i++) #define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++) #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(),(a).rend() #define END(...) { print(__VA_ARGS__); return; } template inline auto rep(T n) { return views::iota(T(0), n); } template inline auto rep(T st, T ed, T step = 1) { return views::iota(T(0), (ed - st) / step) | views::transform([st, step](T i) { return st + i * step; }); } using VI = vector; using VVI = vector; using VVVI = vector; using ll = long long; using VL = vector; using VVL = vector; using VVVL = vector; using ull = unsigned long long; using VUL = vector; using VVUL = vector; using VVVUL = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VS = vector; using VVS = vector; using VVVS = vector; using VC = vector; using VVC = vector; using VVVC = vector; using P = pair; using VP = vector

; using VVP = vector; using VVVP = vector; using LP = pair; using VLP = vector; using VVLP = vector; using VVVLP = vector; template using PQ = priority_queue; template using GPQ = priority_queue, greater>; constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr int DX[] = {1, 0, -1, 0}; constexpr int DY[] = {0, 1, 0, -1}; void print() { cout << '\n'; } template void print(const T &t) { cout << t << '\n'; } template void print(const Head &head, const Tail &... tail) { cout << head << ' '; print(tail...); } #ifdef DEBUG void dbg() { cerr << '\n'; } template void dbg(const T &t) { cerr << t << '\n'; } template void dbg(const Head &head, const Tail &... tail) { cerr << head << ' '; dbg(tail...); } #else template void dbg(const Args &... args) {} #endif template vector> split(typename vector::const_iterator begin, typename vector::const_iterator end, T val) { vector> res; vector cur; for(auto it = begin; it != end; it++) { if(*it == val) { res.push_back(cur); cur.clear(); } else cur.push_back(*it); } res.push_back(cur); return res; } vector split(typename string::const_iterator begin, typename string::const_iterator end, char val) { vector res; string cur = ""; for(auto it = begin; it != end; it++) { if(*it == val) { res.push_back(cur); cur.clear(); } else cur.push_back(*it); } res.push_back(cur); return res; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template pair> compress(const vector &a) { int n = a.size(); vector x; REP(i, n) x.push_back(a[i]); sort(ALL(x)); x.erase(unique(ALL(x)), x.end()); VI res(n); REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin(); return make_pair(res, x); } template auto rle(It begin, It end) { vector> res; if(begin == end) return res; auto pre = *begin; int num = 1; for(auto it = begin + 1; it != end; it++) { if(pre != *it) { res.emplace_back(pre, num); pre = *it; num = 1; } else num++; } res.emplace_back(pre, num); return res; } template vector> rle_sort(It begin, It end) { vector cloned(begin, end); sort(ALL(cloned)); auto e = rle(ALL(cloned)); sort(ALL(e), [](const auto& l, const auto& r) { return l.second < r.second; }); return e; } template pair, vector> factorial(int n) { vector res(n+1), rev(n+1); res[0] = 1; REP(i, n) res[i+1] = res[i] * (i+1); rev[n] = 1 / res[n]; for(int i = n; i > 0; i--) { rev[i-1] = rev[i] * i; } return make_pair(res, rev); } #line 2 "main.cpp" void solve(){ ll n, m; cin >> n >> m; VL a(n), b(n); REP(i, n) cin >> a[i] >> b[i]; auto get_y = [&](ll i, ll x) { if(b[i] == 0) return abs(x-a[i]) * m; ll j = x < a[i] ? 0 : min(m, ((x-a[i])/b[i]) + 1); return (-m+2*j) * (x - (a[i]+j*b[i])) + (j*j - (m-1)*j + m*(m-1)/2) * b[i]; }; VL ps(n); REP(i, n) ps[i] = a[i]*2 + (m-1)*b[i]; VI bsort(n); iota(ALL(bsort), 0); sort(ALL(bsort), [&](int i, int j) { return b[i] < b[j]; }); VI is_small_b(n); int pick = min(n, 300LL); REP(i, pick) { is_small_b[bsort[i]] = 1; } ll q; cin >> q; ll x; cin >> x; VL c(n); cin >> c; VL ans(q); REP(i, q) { VI check(bsort.begin(), bsort.begin()+pick); int r = lower_bound(ALL(ps), x*2) - ps.begin(); int l = r-1; int cnt = 0; while(l >= 0 || r < n) { int nxt = -1; if(l < 0) { nxt = r++; } else if(r >= n) { nxt = l--; } else if(abs(x*2 - ps[l]) < abs(x*2 - ps[r])) { nxt = l--; } else { nxt = r++; } if(is_small_b[nxt]) break; check.push_back(nxt); if(++cnt == pick) break; } pair tmp(LINF, -1); for(int c : check) chmin(tmp, pair(get_y(c, x), c)); x += c[tmp.second]; ans[i] = tmp.second + 1; } print(ans); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); int t = 1; // cin >> t; for(int case_id = 1; case_id <= t; case_id++) solve(); return 0; }