#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;

struct Point
{
trueint pid,st,last,rank;

truePoint(int pid=0,int st=0,int last=0,int rank=0):pid(pid),st(st),last(last),rank(rank)	{}

truevoid Print(int t)			//进程运行完毕时的输出
	{
truetrueprintf("%d %d\n",pid,t);
true}

trueconst bool operator < (const Point& tmp)const{		//将rank高或者rank相等并且st早的进程排在前面
truetruereturn rank<tmp.rank || (rank==tmp.rank && st>tmp.st);
true}
};

priority_queue<Point> q;

int main()
{
trueint a,b,c,d;
trueint t = 0;
truewhile (scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF)			//这里一定要写!=EOF,否则可能超时
true{
truetruewhile ((!q.empty()) && q.top().last + t <= b)
truetrue{
truetruetruePoint p = q.top();
truetruetruet += p.last;		//更改时间
truetruetruep.Print(t);			//输出
truetruetrueq.pop();			//取出已经运行完毕的而进程
truetrue}
truetrueif (!q.empty())			//如果还有进程的话
truetrue{						//该进程可以运行一定时间，但是不能运行完毕
truetruetruePoint p = q.top();	q.pop();
truetruetruep.last -= b - t;
truetruetrueq.push(p);
truetrue}
truetruet = b;		//调整时间

truetrueq.push(Point(a,b,c,d));
true}

truewhile (!q.empty())		//输出所有剩下的进程
true{
truetruePoint p = q.top();
truetruet += p.last;
truetruep.Print(t);
truetrue
truetrueq.pop();
true}
}