#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,m,L;
int posp[500005],D[500005],post[500005],col[500005];
int delp[500005],delt[500005];
pair<int,int> ans[500005];
struct event
{
	int peo,toi,op,t;
	friend bool operator <(event a,event b)
	{
		return a.t>b.t||a.t==b.t&&a.peo>b.peo||a.t==b.t&&a.peo==b.peo&&a.op<b.op;
	}
	void print()
	{
	//	if(op==0) cout << "del: " << peo << " and " << toi << " " << "at " << t << "\n";
	//	else cout << "ins: " << peo << " " << toi << " " << "at " << t << "\n";
	}
};
priority_queue<event> q;
set<int> TOI;
set<pair<int,int> > PEO0,PEO1;
int MOD(int x)
{
	return (x%L+L)%L;
}
vector<pair<int,int> > vt;
int getid(int p)
{
	return (*lower_bound(vt.begin(),vt.end(),make_pair(p,0ll))).second;
}
void INSp(int x,int t,bool flag=1)
{
//	cout << x << "??" << t << "\n";
	if(flag) delp[x]=0;
	if(!TOI.empty())
	{
		if(col[x]==1)
		{
			auto it=TOI.lower_bound(MOD(posp[x]+t));
			if(it!=TOI.end()) q.push({x,getid(*it),0,MOD((*it)-(posp[x]+t))+t});
			else
			{
				it=TOI.begin();
				q.push({x,getid(*it),0,MOD((*it)+L-(posp[x]+t))+t});
			}
		}
		else
		{
			auto it=TOI.upper_bound(MOD(posp[x]-t));
			if(it!=TOI.begin()) --it,q.push({x,getid(*it),0,MOD((posp[x]-t)-(*it))+t});
			else
			{
				it=--TOI.end();
				q.push({x,getid(*it),0,MOD((posp[x]-t)-(*it))+t});
			}
		}
	}
	if(flag)
	{
		if(col[x]==1) PEO1.insert({posp[x],x});
		else PEO0.insert({posp[x],x});
	}
}
void INSt(int x,int t,int flag=1)
{
	if(flag) delt[x]=0;
	if(!PEO1.empty())
	{
		auto it=PEO1.upper_bound(make_pair(MOD(post[x]-t),n));
		if(it!=PEO1.begin())
		{
			int LST=(*prev(it)).first;
			it=PEO1.lower_bound(make_pair(LST,0ll));
			q.push({(*it).second,x,0,MOD(post[x]-t-(*it).first)+t});
		}
		else
		{
			int LST=(*--PEO1.end()).first;
			it=PEO1.lower_bound(make_pair(LST,0ll));
			q.push({(*it).second,x,0,MOD(post[x]-t-(*it).first)+t});
		}
	}
	if(!PEO0.empty())
	{
		auto it=PEO0.lower_bound(make_pair(MOD(post[x]+t),0));
		if(it!=PEO0.end()) q.push({(*it).second,x,0,MOD((*it).first-(post[x]+t))+t});
		else it=PEO0.begin(),q.push({(*it).second,x,0,MOD((*it).first-(post[x]+t))+t});
	}
	if(flag) TOI.insert(post[x]);
}
void DELp(int x,int t)
{
	delp[x]=1;
	if(col[x]==1)
	{
		PEO1.erase(make_pair(posp[x],x));
		if(PEO1.empty()) return ;
		auto it=PEO1.lower_bound({posp[x],0ll});
		if(it!=PEO1.end()) INSp(((*it).second),t,0);
		else if(((*PEO1.begin()).second)!=x) INSp(((*PEO1.begin()).second),t,0);
		if(it!=PEO1.begin())
		{
			int LST=(*prev(it)).first;
			it=PEO1.lower_bound(make_pair(LST,0ll));
			INSp((*it).second,t,0);
		}
		else
		{
			int LST=(*--PEO1.end()).first;
			it=PEO1.lower_bound({LST,0});
			INSp((*it).second,t,0);
		}
	}
	else
	{
		PEO0.erase(make_pair(posp[x],x));
		if(PEO0.empty()) return ;
		auto it=PEO0.lower_bound({posp[x],0ll});
		if(it!=PEO0.end()) INSp(((*it).second),t,0);
		else if(((*PEO0.begin()).second)!=x) INSp(((*PEO0.begin()).second),t,0);
		if(it!=PEO0.begin())
		{
			int LST=(*prev(it)).first;
			it=PEO0.lower_bound(make_pair(LST,0ll));
			INSp((*it).second,t,0);
		}
		else
		{
			int LST=(*--PEO0.end()).first;
			it=PEO0.lower_bound({LST,0});
			INSp((*it).second,t,0);
		}
	}
}
void DELt(int x,int t)
{
	delt[x]=1;
	auto it=TOI.lower_bound(post[x]);
	if(next(it)!=TOI.end()) INSt(getid((*next(it))),t,0);
	else if(getid(*TOI.begin())!=x) INSt(getid(*TOI.begin()),t,0);
	if(it!=TOI.begin()) INSt(getid((*prev(it))),t,0);
	else if(getid(*--TOI.end())!=x) INSt(getid(*--TOI.end()),t,0);
	TOI.erase(post[x]);
	//for(auto t:TOI) cout << t << "??";
	//cout << "\n";
}
signed main()
{
//	freopen("test.in","r",stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> L;
	for(int i=1;i<=n;i++) delp[i]=1;
	for(int i=1;i<=m;i++)
	{
		cin >> post[i];
		vt.push_back({post[i],i});
		q.push({0,i,1,0});
	}
	sort(vt.begin(),vt.end());
	for(int i=1;i<=n;i++)
	{
		int t,p,d;
		char s;
		cin >> t >> p >> s >> d;
		if(s=='+') col[i]=1;
		else col[i]=-1;
		D[i]=d;
		posp[i]=MOD(p-t*col[i]);
		q.push({i,0,1,t});
	}
	//q.push({45,4,0,8997});
//	cout << posp[3] << "??\n";
	while(!q.empty())
	{
		event x=q.top();
		q.pop();
		if(x.op==0)
		{
			if(delp[x.peo]||delt[x.toi]) continue;
			x.print();
			ans[x.peo]={post[x.toi],x.t};
			q.push({0,x.toi,1,x.t+D[x.peo]});
			DELp(x.peo,x.t);
			DELt(x.toi,x.t);
		}
		else
		{
			x.print();
			if(x.peo) INSp(x.peo,x.t);
			if(x.toi) INSt(x.toi,x.t);
		}
	}
	for(int i=1;i<=n;i++)
	{
		cout << ans[i].first << " " << ans[i].second << "\n";
	}
	return 0;
}
/*
10 5 100
1 5 10 11 17 
146 0 - 185
203 50 + 114
387 9 - 178
456 77 + 135
551 67 + 153
604 45 + 172
712 82 + 102
828 15 + 153
948 97 - 112
1026 15 - 136


5 3 45
10 20 30
0 0 + 200
2 5 + 10
20 40 - 100
21 16 + 10
50 0 + 22

*/