codeforces round #234B(DIV2) C Inna and Huge Candy Matrix

#include <iostream>

#include <vector>

#include <algorithm>

#include <utility>

using namespace std;

typedef pair<int,int> Point;

int n,m;

void clockwise_rotate(Point &cell, int x){

    for(int i = ; i < x; ++ i){

        int tmp = cell.first;

        cell.first = cell.second;

        cell.second = n-tmp + ;

        swap(n,m);

    }

}

void horizontal_rotate(Point &cell, int y){

    if(y==) cell.second = m - cell.second +;

}

int main(){

    int x,y,z,p;

    cin >> n >> m >> x >> y >> z >> p;

    x %=; y %=; z %= ;

    int tmp_n = n,tmp_m = m;

    for(int i =  ; i <  p; ++ i){

        n = tmp_n; m =tmp_m;

        int cellX,cellY;

        cin >> cellX >> cellY;

        Point cell = make_pair(cellX,cellY);

        clockwise_rotate(cell,x);

        horizontal_rotate(cell,y);

        clockwise_rotate(cell,-z);

        cout<<cell.first<<" "<<cell.second<<endl;

    }

    return ;

}