#ifdef _WIN32
#  define LL "%I64d"
#else
#  define LL "%Ld"
#endif

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <ctime>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <string>
#include <algorithm>
#include <complex>
#include <utility>
#include <cassert>
using namespace std;
#define null NULL
#define mp make_pair
#define pb(a) push_back(a)
#define sz(a) ((int)(a).size())
#define all(a) a.begin() , a.end()
#define fi first
#define se second
#define relaxMin(a , b) (a) = min((a),(b))
#define relaxMax(a , b) (a) = max((a),(b))
#define SQR(a) ((a)*(a))
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
vector<ll> ini , a , b , mod;
int N , M;
struct compare{
  bool operator()(const int& f , const int& s) const{
   return mp(ini[f] , f) < mp(ini[s] , s);
                                                    }
};
set<int , compare> nal;
vector<ll> red;
vi Q;
void nxt(int p){
  ini[p] += ((ini[p]%mod[p])*a[p] + b[p])%mod[p];
}
int UPTO = 2;
int main(){
  freopen("arrays.in" , "r" , stdin);
  freopen("arrays.out" , "w" , stdout);
  scanf("%d" , &N);
  for(int i=0;i<N;++i){
   int _ini , _a , _b , _mod;
   scanf("%d%d%d%d" , &_ini , &_a , &_b , &_mod);
   ini.pb(_ini);
   a.pb(_a);
   b.pb(_b);
   mod.pb(_mod);
   a.back() %= mod.back();
   b.back() %= mod.back();
                      }
  scanf("%d" , &M);
  Q.resize(M);
  for(int i=0;i<M;++i)
   scanf("%d" , &Q[i]),
   relaxMax(UPTO , Q[i]);
  // sol
  for(int i=0;i<N;++i)
   nal.insert(i);
  for(int i=0;i<UPTO;++i){
   int pos = *nal.begin();
   nal.erase(pos);
   red.pb(ini[pos]);
   nxt(pos);
   nal.insert(pos);
                         }
  for(int i=0;i<sz(Q);++i)
   printf("%I64d\n" , red[Q[i]-1]);
  return 0;
}