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 Ruby (judge verdict: Accepted)

class Dice
  attr :top, :front, :right, :left, :back, :bottom
  def initialize a,b,c,d,e,f
    @top = a; @front = b; @right = c; @left = d; @back = e; @bottom = f
  end
  def rotN
    t = @top; @top = @front; @front = @bottom; @bottom = @back; @back = t
  end
  def rotE
    t = @top; @top = @left; @left = @bottom; @bottom = @right; @right = t
  end
  def rotW
    t = @top; @top = @right; @right = @bottom; @bottom = @left; @left = t
  end
  def rotS
    t = @top; @top = @back; @back = @bottom; @bottom = @front; @front = t
  end
  def rotV
    t = @front; @front = @left; @left = @back; @back = @right; @right = t
  end
end

a,b,c,d,e,f = gets.split.map {|s| s.to_i}
die = Dice.new(a,b,c,d,e,f)
n = gets.to_i
for i in 1..n
  t,f = gets.split.map {|s| s.to_i}
  if die.right == t
    die.rotW
  elsif die.left == t
    die.rotE
  else
    until die.top == t
      die.rotN
    end
  end
  until die.front == f
    die.rotV
  end
  puts die.right
end