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: Accepted)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		Dice dc = new Dice();

		for (int i = 0; i < 6; i++) {
			dc.n[i] = sc.nextInt();
		}
		int q = sc.nextInt();
		int top, front;
		int[] r = new int[q];
		for (int i = 0; i < q; i++) {
			top = sc.nextInt();
			front = sc.nextInt();
			r[i] = dc.getRight(top, front);
		}

		for (int i = 0; i < q; i++) {
			System.out.println(r[i]);
		}
	}

}

class Dice {
	public int[] n = new int[6];
	private int temp = 0;

	void north() {
		temp = n[0];
		n[0] = n[1];
		n[1] = n[5];
		n[5] = n[4];
		n[4] = temp;
	}

	void south() {
		temp = n[0];
		n[0] = n[4];
		n[4] = n[5];
		n[5] = n[1];
		n[1] = temp;
	}

	void west() {
		temp = n[0];
		n[0] = n[2];
		n[2] = n[5];
		n[5] = n[3];
		n[3] = temp;
	}

	void east() {
		temp = n[0];
		n[0] = n[3];
		n[3] = n[5];
		n[5] = n[2];
		n[2] = temp;
	}
	void right() {
        temp = n[1];
        n[1] = n[2];
        n[2] = n[4];
        n[4] = n[3];
        n[3] = temp;
    }

	int getRight(int t, int f) {
		for (int i = 0; i < 3; i++) {
			if (t == n[0]) {
				break;
			}
			north();
			if (t == n[0]) {
				break;
			}
			west();
		}
		for (int i = 0; i < 3; i++) {
			if (f == n[1]) {
				break;
			}
			right();
		}
		return n[2];
	}

}