#include<bits/stdc++.h>
#define inf 0x7fffffff
#define mod 998244353
#define ll long long
#define M 500010
#define N 100010
#define quickly ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
int head[N],dis[N],cnt,k[N];
ll ans,n,m,s;
bool vis[N];
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;
}
struct edge{
	ll to,dis,next;
}e[M];
inline void add(int u,int v,int d){
	e[++cnt].dis=d;
	e[cnt].to=v;
	e[cnt].next=head[u];
	head[u]=cnt;
}
struct node{
	ll dis;
	ll pos;
	bool operator <(const node &x)const{
		return x.dis < dis;
	}
};
std::priority_queue<node> q;
inline void dijkstra(){
	std::memset(dis,0x3f,sizeof(dis));
	dis[s]=0;
	q.push((node){0,s});
	while(!q.empty()){
		node tmp=q.top();
		q.pop();
		int x=tmp.pos;
		//		int d=tmp.dis;
		if(vis[x])
			continue;
		vis[x]=1;
		for(int i=head[x];i;i=e[i].next){
			int y=e[i].to;
			if(dis[y]>dis[x]+e[i].dis){
				dis[y]=dis[x]+e[i].dis;
				if(!vis[y]){
					q.push((node){dis[y],y});
				}
			}
		}
	}
}
queue<ll> te;
void spfa(int t){
	for(int i=1;i<=n;i++) dis[i]=1e9,k[i]=0;
	te.push(t);
	dis[t]=0;
	vis[t]=1;
	k[t]=1;
	do{
		//		cout<<"gkjdljfhbkmdj"<<endl;
		ll x=te.front();
		te.pop();
		vis[x]=0;
		for(int i=head[x];i;i=e[i].next){
			ll y=e[i].to,di=dis[x]+e[i].dis;
			if(dis[y]>di){
				dis[y]=di;
				if(!vis[y]){
					te.push(y);
					if(k[y]==n){
						return ;
					}
					k[y]++;
					vis[y]=1;
				}
			}
		}
	}while(te.size());
}
//bcj
struct bcj{ 
	int len;      
	int q[30010],si[30010];           
	void init(int lenn){       
		len=lenn;
		for(int i=1;i<=len;i++)
			q[i]=i,si[i]=1;
	}
	int Find(int t){        
		if(q[t]==t) return t;
		int tt=Find(q[t]);
		q[t]=tt;
		return tt;
	}
	bool same(int a,int b){
		int a_1=Find(a),b_1=Find(b);
		return a_1==b_1;
	}
	void add(int a,int b){  
		if(same(a,b)) return ;
		q[q[a]]=q[b];
		si[q[b]]+=si[q[a]];
	}
	int num(){
		int ans=0;
		for(int i=1;i<=len;i++)
			if(q[i]==i)
				ans++;
		return ans;
	}
	int Long(int a){
		return si[Find(a)];
	}
	void clean(){
		for(int i=1;i<=len;i++)
			q[i]=0,si[i]=0;
		len=0;
	}
}a;
struct ed{ll u,v,w;}edg[5005];
bool cmp(ed a,ed b){return a.w<b.w;}
void kruskal(ll n,ll m){
	sort(edg+1,edg+m+1,cmp);
	a.init(n);
	ll cnt=0;
	for(int i=1;i<=m;i++){
		if(cnt==n-1) break;
		ll e1=a.Find(edg[i].u),e2=a.Find(edg[i].v);
		if(e1==e2) continue;
		else a.add(e1,e2),cnt++,ans+=edg[i].w;
	}
	if(cnt!=n-1) {cout<<"orz\n";exit(0);}
}
struct ST{
	ll maxx[N][25],minn[N][25];
	void init(ll a[],ll n){
		for(int i=1;i<=n;i++)
			minn[i][0]=maxx[i][0]=a[i];
		ll p=log2(n);
		for(int i=1;i<=p;i++){
			for(int j=1;j+(1<<i)<=n+1;j++){
				maxx[j][i]=max(maxx[j][i-1],maxx[j+(1<<(i-1))][i-1]);
				minn[j][i]=min(minn[j][i-1],minn[j+(1<<(i-1))][i-1]);
			}
		}
	}
	ll _max_(ll l,ll r){
		int k=log2(r-l+1);
		return max(maxx[l][k],maxx[r-(1<<k)+1][k]);
	}
	ll _min_(ll l,ll r){
		int k=log2(r-l+1);
		return min(minn[l][k],minn[r-(1<<k)+1][k]);
	}
}st;
struct BLT{ //Binary Lndexed Trees
	ll c[1001],len;
	void init(ll n){
		len=n;
	}
	ll lowbit(ll x){
		return x&(-x);
	}
	ll sum(ll i){     //1~i
		ll s=0;
		for(;i>0;i-=lowbit(i))
			s+=c[i];
		return s;
	}
	void add(ll i,ll z){   //a[i]+=z
		for(;i<=len;i+=lowbit(i))
			c[i]=z;
	}
	ll num(ll i,ll j){    //i~j
		return sum(j)-sum(i-1);
	}
}blt;
struct ppair{
	ll u,v,w,x;
	bool operator <(const ppair x)const{
		if(u==x.u) return x.v<v;
		return x.u>u;
	}
};
ll u,v,t,x;
ppair p;
priority_queue<ppair> pqp;
int main(){
	//	freopen("a.in","r",stdin);
	//	freopen("a.out","w",stdout);
//	quickly;
	x=0;
	while(scanf("%lld %lld %lld %lld",&n,&m,&u,&v)!=EOF){
		while(!pqp.empty()){
			p=pqp.top();
			if(p.w+t>m) break;
			cout<<p.v<<' '<<t+p.w<<endl;
			t+=p.w;
			pqp.pop();
		}
		p=pqp.top();
		pqp.pop();
		p.w-=(m-t);
		pqp.push(p);
		t=m;
		pqp.push({v,n,u,m});
	}
	while(!pqp.empty()){
		p=pqp.top();
		cout<<p.v<<' '<<t+p.w<<endl;
		t+=p.w;
		pqp.pop();
	}
	
	return 0;
}