Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Inna and Huge Candy Matrix

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputInna and Dima decided to surprise Sereja. They brought a really huge candy matrix, it's big even for Sereja! Let's number the rows of the giant matrix from 1 to *n* from top to bottom and the columns — from 1 to *m*, from left to right. We'll represent the cell on the intersection of the *i*-th row and *j*-th column as (*i*, *j*). Just as is expected, some cells of the giant candy matrix contain candies. Overall the matrix has *p* candies: the *k*-th candy is at cell (*x*_{k}, *y*_{k}).

The time moved closer to dinner and Inna was already going to eat *p* of her favourite sweets from the matrix, when suddenly Sereja (for the reason he didn't share with anyone) rotated the matrix *x* times clockwise by 90 degrees. Then he performed the horizontal rotate of the matrix *y* times. And then he rotated the matrix *z* times counterclockwise by 90 degrees. The figure below shows how the rotates of the matrix looks like.

Inna got really upset, but Duma suddenly understood two things: the candies didn't get damaged and he remembered which cells contained Inna's favourite sweets before Sereja's strange actions. Help guys to find the new coordinates in the candy matrix after the transformation Sereja made!

Input

The first line of the input contains fix integers *n*, *m*, *x*, *y*, *z*, *p* (1 ≤ *n*, *m* ≤ 10^{9}; 0 ≤ *x*, *y*, *z* ≤ 10^{9}; 1 ≤ *p* ≤ 10^{5}).

Each of the following *p* lines contains two integers *x*_{k}, *y*_{k} (1 ≤ *x*_{k} ≤ *n*; 1 ≤ *y*_{k} ≤ *m*) — the initial coordinates of the *k*-th candy. Two candies can lie on the same cell.

Output

For each of the *p* candies, print on a single line its space-separated new coordinates.

Examples

Input

3 3 3 1 1 9

1 1

1 2

1 3

2 1

2 2

2 3

3 1

3 2

3 3

Output

1 3

1 2

1 1

2 3

2 2

2 1

3 3

3 2

3 1

Note

Just for clarity. Horizontal rotating is like a mirroring of the matrix. For matrix:

QWER REWQ

ASDF -> FDSA

ZXCV VCXZ

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/09/2021 10:56:52 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|