CF400C.Inna and Huge Candy Matrix

Inna 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!

因娜和迪马决定给谢尔盖一个惊喜。他们带来了一个超大的糖果矩阵，这个矩阵甚至对谢尔盖来说都大得惊人！我们从上到下将该巨型矩阵的行编号为 $1$ 到 $n$，从左到右将列编号为 $1$ 到 $m$。我们将第 $i$ 行与第 $j$ 列相交的单元格记作 $(i,\,j)$。正如预期的那样，巨型糖果矩阵中的一些单元格含有糖果。整个矩阵共有 $p$ 颗糖果：第 $k$ 颗糖果位于单元格 $(x_k,\,y_k)$。

晚餐时间临近，因娜正准备从矩阵中取走她最喜爱的 $p$ 颗糖果，这时谢尔盖（原因他并未向任何人透露）突然将矩阵顺时针旋转了 $x$ 次，每次 $90^\circ$；接着又水平翻转（即沿垂直中线镜像）了 $y$ 次；最后再逆时针旋转了 $z$ 次，每次 $90^\circ$。下图展示了矩阵的这些旋转操作效果：

因娜非常沮丧，但杜马却突然明白了两件事：糖果本身并未受损，而且他还记得在谢尔盖进行这些奇怪操作之前，哪些单元格里放着因娜最喜爱的糖果。请帮助他们找出谢尔盖完成上述变换后，这些糖果在糖果矩阵中的新坐标！

The first line of the input contains fix integers n, m, x, y, z, p (1 ≤ n, m ≤ 109; 0 ≤ x, y, z ≤ 109; 1 ≤ p ≤ 105).

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.

输入的第一行包含六个整数 $n$、$m$、$x$、$y$、$z$、$p$（其中 $1 \leq n, m \leq 10^9$；$0 \leq x, y, z \leq 10^9$；$1 \leq p \leq 10^5$）。

接下来的 $p$ 行，每行包含两个整数 $x_k$、$y_k$（$1 \leq x_k \leq n$；$1 \leq y_k \leq m$），表示第 $k$ 颗糖果的初始坐标。两颗糖果可以位于同一格子中。

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

对于每颗糖果 $p$，请在单独一行中输出其以空格分隔的新坐标。

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

QWER REWQ
ASDF -> FDSA
ZXCV VCXZ

仅为明确说明：水平旋转类似于矩阵的镜像翻转。对于矩阵：

QWER → REWQ
ASDF → FDSA
ZXCV → VCXZ