//泥の分際で私だけの大切を奪おうだなん
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
#define int long long
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
pair<int,int> ans[1<<18];
int a[1<<18],lst[1<<18];
struct node{int t,p,s,d;}b[1<<18];
bool vis[1<<18];
int n=read(),m=read(),L=read();
int calc(int pid,int tid)
{
	int dist=(a[tid]+L-b[pid].p)%L;
	if(!b[pid].s) dist=(L-dist)%L;
	int sdt=b[pid].t+dist;
	int require=max(0ll,lst[tid]-sdt);
	return sdt+((require+L-1)/L)*L;
}
int best_match_toliet(int x)
{
	int mn=1e18,id=-1;
	for(int i=1; i<=m; ++i)
	{
		int tmp=calc(x,i);
		if(tmp<mn) mn=tmp,id=i;
	}
	return id;
}
int best_match_person(int x)
{
	int mn=1e18,id=-1;
	for(int i=1; i<=n; ++i) if(!vis[i])
	{
		int tmp=calc(i,x);
		if(tmp<mn) mn=tmp,id=i;
	}
	// assert(id!=-1);
	return id;
}
void Match(int pid,int tid)
{
	int dist=(a[tid]+L-b[pid].p)%L;
	if(!b[pid].s) dist=(L-dist)%L;
	int sdt=b[pid].t+dist;
	int require=max(0ll,lst[tid]-sdt);
	ans[pid]={a[tid],sdt+((require+L-1)/L)*L};
	lst[tid]=sdt+((require+L-1)/L)*L+b[pid].d;
	vis[pid]=1;
}
signed main()
{
	for(int i=1; i<=m; ++i) a[i]=read(),lst[i]=-1e18;
	sort(a+1,a+m+1);
	for(int i=1; i<=n; ++i)
		b[i].t=read(),b[i].p=read(),
		b[i].s=(getchar()=='+'),b[i].d=read();
	for(int T=n; T--;)
	{
		int A=best_match_person(1);
		int B=best_match_toliet(A);
		int C=best_match_person(B);
		while(A!=C)
		{
			A=C;
			B=best_match_toliet(A),
			C=best_match_person(B);
		}
		Match(C,B);
	}
	for(int i=1; i<=n; ++i)
		printf("%lld %lld\n",ans[i].first,ans[i].second);
	return 0;
}