#include <stdio.h>

#define MAX_N	1000

int M, N, in, d, pr, ti;
int sx, sy, zx, zy, kx, ky;

/* Spočte čas, za který přijede nejbližší tramvaj */
int next_tram(int x, int t)
{
	int h=t-x*d;
	return (h<=0)?-h:((h%in)?in-h%in:0);
}

int rotatex(int x)
{
	return (sx?(N-x-zx):(x+zx))-1;
}

int rotatey(int y)
{
	return (sy?(M-y-zy):(y+zy))-1;
}

int main(void)
{
	int timex[MAX_N][MAX_N], timey[MAX_N][MAX_N];
	int x, y, h;
	
	scanf("%d %d %d %d %d %d", &M, &N, &in, &d, &pr, &ti);
	scanf("%d %d %d %d", &zx, &zy, &kx, &ky);

	if (sx=(zx>kx)){
		zx=N-zx;
		kx=N-kx;
	}
	if (sy=(zy>ky)){
		zy=M-zy;
		ky=M-ky;
	}
	
	timex[0][0]=next_tram(0, ti);
	timey[0][0]=next_tram(0, ti);
	
	for (x=1; x<kx-zx; x++){
		timex[x][0]=timex[0][0]+x*d;
		timey[x][0]=timex[x][0]+pr+next_tram(0, timex[x][0]+pr);
	}
	for (y=1; y<ky-zy; y++){
		timey[0][y]=timey[0][0]+y*d;
		timex[0][y]=timey[0][y]+pr+next_tram(0, timey[0][y]+pr);
	}
	
	for (x=1; x<=kx-zx; x++){
		for (y=1; y<=ky-zy; y++){
			h=timey[x][y-1]+pr+next_tram(x, timey[x][y-1]+pr+d);
			if (timex[x-1][y]<h){
				timex[x][y]=timex[x-1][y]+d;
			}else{
				timex[x][y]=h+d;
			}
			h=timex[x-1][y]+pr+next_tram(y, timex[x][y-1]+pr+d);
			if (timey[x][y-1]<h){
				timex[x][y]=timex[x][y-1]+d;
			}else{
				timex[x][y]=h+d;
			}
		}
	}
	
	x=kx-zx; y=ky-zy;
	printf("%d %d\n", rotatex(kx), rotatey(ky));
	while (x!=0 || y!=0){
		if (y>0 && timex[x-1][y]>timey[x][y-1])
			y--;
		else
			x--;
		printf("%d %d\n", rotatex(x+zx), rotatey(y+zy));
	}

	return 0;
}