#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define INF 1000000001LL
#define POT (1LL<<23)
#define INFL 1000000000000000099LL
#define pii pair<ll,ll>
#define ppi pair<pii,ll>
#define pip pair<ll,pii>
#define ppp pair<pii,pii>
#define vi vector<ll>
#define vii vector<pii>
#define vvi vector<vi>
#define al(x) x.begin(),x.end()
#define rev(x) reverse(al(x))
#define X 18
#define FCTCST 7
template<typename T, typename U>
pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first + b.first, a.second + b.second};
}
template<typename T, typename U>
pair<T, U> operator-(const pair<T, U>& a, const pair<T, U>& b) {
return {a.first - b.first, a.second - b.second};
}
template<typename T, typename U,typename Z>
pair<T, U> operator*(const pair<T, U>& a, const Z& b) {
return {a.first*b, a.second*b};
}
template<typename T, typename U,typename Z>
pair<T, U> operator/(const pair<T, U>& a, const Z& b) {
return {a.first/b, a.second/b};
}
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
os<<"{"<<p.ff<<", "<<p.ss<<"}";
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (size_t i = 0; i < v.size(); ++i) {
if (i) os << ", ";
os << v[i];
}
os << "}";
return os;
}
template<ll MOD=998244353>
struct mint_t{
ll x;
mint_t(ll y=0){x=y%MOD;if(x<0)x+=MOD;}
mint_t& operator+=(const mint_t& a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
mint_t& operator-=(const mint_t& a){if((x+=MOD-a.x)>=MOD)x-=MOD;return *this;}
mint_t operator+(const mint_t& a)const{mint_t res(*this);return res+=a;}
mint_t operator-(const mint_t& a)const{mint_t res(*this);return res-=a;}
mint_t& operator*=(const mint_t& a){(x*=a.x)%=MOD;return *this;}
mint_t operator*(const mint_t& a)const{mint_t res(*this);return res*=a;}
mint_t fp(ll y)const{
mint_t a=1,b=x;
while(y){
if(y&1)a*=b;
b*=b;
y/=2;
}
return a;
}
mint_t& operator/=(const mint_t& a){(*this)*=a.fp(MOD-2);return *this;}
mint_t operator/(const mint_t& a)const{mint_t res(*this);return res/=a;}
};
#define mint mint_t<>
template<long long MOD>
istream& operator>>(istream& in, mint_t<MOD>& a){
ll x;
in>>x;
a=mint_t<MOD>(x);
return in;
}
template<long long MOD>
istream& operator<<(istream& out, mint_t<MOD>& a){
out<<a.x;
return out;
}
mint fct[FCTCST];
mint bnm(ll a,ll b){
if(b>a || a<0)return 0;
return fct[a]/fct[b]/fct[a-b];
}
ll n,l,t,a,b,c;
ll md(ll a,ll b){
return a%b;
}
ll ns[1000007];
void solve(){
vector<pip>v;
cin>>n>>l>>t;
for(ll i=0;i<n;i++){
cin>>a>>b>>c;
v.pb({-c,{a,b}});
}
sort(al(v));
vii v2;
for(ll i=0;i<n;i++){
v2.pb({v[i].ss.ff,i});
}
sort(al(v2));
vii ev;
for(ll i=0;i<n;i++){
vi ak,ak2;
for(ll j=0;j<n;j++)if(v2[j].ss<=i)ak2.pb(v2[j].ss),ak.pb(v2[j].ff);
ak.pb(t);
ll poz;
//cout<<ak<<"\n";
vii fin;
vii dod;
bool bl=0;
ll mjksz;
for(ll j=0;j<ak.size()-1;j++){
ll il=v[ak2[j]].ss.ss;
ll df=ak[j+1]-ak[j];
if(bl)fin.pb({0,-il});
if(ak2[j]==i){
poz=t-ak[j];
mjksz=-v[ak2[j]].ff;il=0;
bl=1;
for(pii k :dod){
fin.pb({k.ff,-k.ss});
}
fin.pb({0,-v[ak2[j]].ss.ss});
//if(dod.empty())continue;
}
while(dod.size()){
if(df>=il*dod.back().ff){
df+=dod.back().ff*dod.back().ss;
il+=dod.back().ss;
dod.pop_back();
}
else break;
}
if(il){
ll czs=(df)/il;
if(dod.size() && dod.back().ff==czs+1){
dod.back().ss+=md(df,il);
}
else dod.pb({czs+1,md(df,il)});
dod.pb({czs,il-md(df,il)});
}
}
ll lft=t;
vii mrg;
// cout<<dod<<" "<<fin<<"\n";
rev(dod);rev(fin);
while(dod.size() || fin.size()){
if(fin.empty() ||( dod.size() && dod.back().ff>fin.back().ff)){
if(mrg.size() &&mrg.back().ff==dod.back().ff)mrg.back().ss+=dod.back().ss;
else mrg.pb(dod.back());
dod.pop_back();
}
else{
if(mrg.size() &&mrg.back().ff==fin.back().ff)mrg.back().ss+=fin.back().ss;
else mrg.pb(fin.back());
fin.pop_back();
}
}
mrg.insert(mrg.begin(),{INFL,0});
for(ll j=0;j<mrg.size();j++)mrg[j].ss*=-1;
// cout<<mrg<<"\n\n";
ll pt=0;
ll akr=0;
while(1){
if( akr && (mrg.back().ff-pt)>=(poz+akr-1)/akr){
ll czs=(poz/akr)+pt;
ev.pb({czs+2,(poz%akr)*mjksz});
ev.pb({czs+1,(akr-poz%akr)*mjksz});
for(pii i : mrg)ev.pb({i.ff+1,i.ss*mjksz});
break;
}
else{
poz-=akr*(mrg.back().ff-pt);
pt=mrg.back().ff;
akr+=mrg.back().ss;
mrg.pop_back();
}
}
//cout<<ev<<"ev\n\n\n";
}
sort(al(ev));
vii zap;
ll q;cin>>q;
for(ll i=0;i<q;i++){
cin>>a;zap.pb({a,i});
}
sort(al(zap));
rev(zap);rev(ev);
//cout<<ev<<"\n";
ll ak=0,ak2=0,pp=0;
while(zap.size()){
while(ak2<=0 || (ev.back().ff-pp)<=(zap.back().ff-ak)/ak2){
ak+=ak2*(ev.back().ff-pp);
ak2+=ev.back().ss;
pp=ev.back().ff;ev.pop_back();
}
//cout<<ak2<<" ";
ns[zap.back().ss]=pp+(zap.back().ff-ak)/ak2-1;
zap.pop_back();
}
for(ll i=0;i<q;i++)cout<<min(l,ns[i])<<"\n";
}
int main(){
fct[0]=1;
for(ll i=1;i<FCTCST;i++)fct[i]=fct[i-1]*i;
ll t=1;
//cin>>t;
for(ll i=1;i<=t;i++){
//cout<<"Case #"<<i<<": ";
solve();
}
}
