Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Dice II

Construct a dice from a given sequence of integers in the same way as Dice I.

You are given integers on the top face and the front face after the dice was rolled in the same way as Dice I. Write a program to print an integer on the right side face.

Input

In the first line, six integers assigned to faces are given in ascending order of their corresponding labels.
In the second line, the number of questions $q$ is given.

In the following $q$ lines, $q$ questions are given. Each question consists of two integers on the top face and the front face respectively.

Output

For each question, print the integer on the right side face.

Constraints

$0 \leq $ the integer assigned to a face $ \leq 100$

The integers are all different

$1 \leq q \leq 24$

Sample Input

1 2 3 4 5 6
3
6 5
1 3
3 2

Sample Output

3
5
6

Solution in JAVA (judge verdict: Time Limit Exceeded)

import java.util.*;

class Main {
	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int[] num = new int[6];
		for (int i=0; i<6; i++) {
			num[i] = stdIn.nextInt();
		}
		Dice dice = new Dice();
		int n = stdIn.nextInt();
		for (int i=0; i<n; i++) {
			int t = stdIn.nextInt();
			int f = stdIn.nextInt();
			int top = 0;
			int front = 0;
			for(int j=0; j<6; j++){
				if(t == num[j]){
					top = j+1;
				}else if(f == num[j]){
					front = j+1;
				}
			}
			System.out.println(num[dice.solve(top,front)-1]);
		}
	}

	static class Dice {

		private int top = 1;
		private int front = 2;
		private int right = 3;
		private int left = 4;
		private int back = 5;
		private int bottom = 6;

		Dice(){
		}

		void change(char dir) {
			int temp = 0;
			switch(dir){
				case 'N': moveN(); break;
				case 'S': moveS(); break;
				case 'E': moveE(); break;
				case 'W': moveW(); break;
			}
		}

		void moveN(){
			int temp = top;
			top = front;
			front = bottom;
			bottom = back;
			back = temp;
		}

		void moveS(){
			int temp = top;
			top = back;
			back = bottom;
			bottom = front;
			front = temp;
		}

		void moveE(){
			int temp = top;
			top = left;
			left = bottom;
			bottom = right;
			right = temp;
		}

		void moveW(){
			int temp = top;
			top = right;
			right = bottom;
			bottom = left;
			left = temp;
		}

		int isTop(){
			return top;
		}

		int isRight(){
			return right;
		}

		int solve(int top,int front){
			boolean flag = false;
			for (int i=0; i<3; i++) {
				moveN();
				if(this.top == top){
					flag = true;
					break;
				}
			}
			if(!flag){
				while(this.top != top){
					moveE();
				}
			}
			while(this.front != front){
				turn();
			}
			return this.right;
		}

		void turn(){
			int temp = this.front;
			this.front = right;
			right = back;
			back = left;
			left = temp;
		}
	}
}