#include <iostream>
using namespace std;

int main() {
	int dice[6];
	for (int i = 0;i < 6;++i) {
		cin >> dice[i];
	}
	int n;
	cin >> n;
	while (n--) {
		int top,front;
		cin >> top >> front;
		// check top
		if (top == dice[0] || top == dice[2] || top == dice[3] || top == dice[5]) {
			// roll the dice in the direction of east till "top == dice[0]"
			while (top != dice[0]) {
				int temp = dice[0];
				dice[0] = dice[3];
				dice[3] = dice[5];
				dice[5] = dice[2];
				dice[2] = temp;
			}
		} else {
			// roll the dice in the direction of north till "top == dice[0]"
			while (top != dice[0]) {
				int temp = dice[0];
				dice[0] = dice[1];
				dice[1] = dice[5];
				dice[5] = dice[4];
				dice[4] = temp;
			}
		}
		// rotate the dice till "front == dice[1]"
		while (front != dice[1]) {
			int temp = dice[1];
			dice[1] = dice[2];
			dice[2] = dice[4];
			dice[4] = dice[3];
			dice[3] = temp;
		}
		cout << dice[2] << endl;
	}
}
### Prompt

Generate a Cpp solution to the following problem:

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.


<image>


Constraints

* $0 \leq $ the integer assigned to a face $ \leq 100$
* The integers are all different
* $1 \leq q \leq 24$

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.

Example

Input

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


Output

3
5
6

### Response

```cpp
#include <iostream>
using namespace std;

int main() {
	int dice[6];
	for (int i = 0;i < 6;++i) {
		cin >> dice[i];
	}
	int n;
	cin >> n;
	while (n--) {
		int top,front;
		cin >> top >> front;
		// check top
		if (top == dice[0] || top == dice[2] || top == dice[3] || top == dice[5]) {
			// roll the dice in the direction of east till "top == dice[0]"
			while (top != dice[0]) {
				int temp = dice[0];
				dice[0] = dice[3];
				dice[3] = dice[5];
				dice[5] = dice[2];
				dice[2] = temp;
			}
		} else {
			// roll the dice in the direction of north till "top == dice[0]"
			while (top != dice[0]) {
				int temp = dice[0];
				dice[0] = dice[1];
				dice[1] = dice[5];
				dice[5] = dice[4];
				dice[4] = temp;
			}
		}
		// rotate the dice till "front == dice[1]"
		while (front != dice[1]) {
			int temp = dice[1];
			dice[1] = dice[2];
			dice[2] = dice[4];
			dice[4] = dice[3];
			dice[3] = temp;
		}
		cout << dice[2] << endl;
	}
}
```