#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
ll llceil(ll a, ll b) { return (a + b - 1) / b; }
string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; }
string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
static const double EPS = 1e-10;
static const double PI  = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    ll N; cin >> N;
    VLL A(N),T(N); REP(i,N) cin >> A[i] >> T[i];

    ll Q; cin >> Q;
    VLL X(Q); REP(i,Q) cin >> X[i];

    ll L = -INF, R = INF;
    ll S = 0;  // shift
    REP(i,N) {
        ll a = A[i];
        ll t = T[i];
        if (t == 1) {  // x + a
            S += a;
            L += a;
            R += a;
        } else if (t == 2) {  // max(x, a)
            chmax(L, a);
            if (R < L) R = L;
        } else if (t == 3) {  // min(x, a)
            chmin(R, a);
            if (R < L) L = R;
        }
    }

    // debug(L); debug(R);
    // debug(S);

    for (ll x : X) {
        if (x + S < L) {
            COUT(L);
        } else if (R < x + S) {
            COUT(R);
        } else {
            COUT(x + S);
        }
    }

    // REP(_,L) COUT(X[L] + S);
    // FOR(i,L,R+1) COUT(X[i] + S);
    // REP(_,(Q-1)-R) COUT(X[R] + S);


    return 0;
}

#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_element(ALL(a)))
#define Min(a) (*min_element(ALL(a)))
using namespace std;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;cin>>n;
    ll ma = -2*llINF,mi = 2*llINF,plus = 0;
    while(n--){
        ll a,t;cin>>a>>t;
        if(t == 1){
            ma += a;
            mi += a;
            plus += a;
        }else if(t == 2){
            ma = max(ma,a);
            mi = max(mi,a);
        }else{
            ma = min(ma,a);
            mi = min(mi,a);
        }
    }
    ll q;cin>>q;
    while(q--){
        ll a;cin>>a;
        //cout << ma << " " << mi << endl;
        cout << min(mi,max(ma,a+plus)) << endl;
    }
    return 0;
}