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)

#$debug=3
$debug=0

def aux0()
  h=[]
  #a=[[2,3,5,4,2],[1,4,6,3,1],[1,2,6,5,1],[1,5,6,2,1],[1,3,6,4,1],[3,2,4,5,3]]
  a=[[1,2,4,3,1],[0,3,5,2,0],[0,1,5,4,0],[0,4,5,1,0],[0,2,5,3,0],[2,1,3,4,2]]
  6.times{|t|
    h[t]=[]
    4.times{|i|
      h[t][a[t][i]]=a[t][i+1]
    }
  }
  h
end

def main
  if $debug&1==1 
    fh=File.open("ITP1_11_B.txt")
  else
    fh=STDIN
  end
  b = fh.gets.chomp.split
  n = fh.gets.chomp.to_i
  puts "b: #{b.to_s}" if $debug&2==2
  puts "n: #{n}" if $debug&2==2
  h=aux0
  n.times {|i|
    x=fh.gets.chomp.split
    puts "x: #{x.to_s}" if $debug&2==2
    fr = x.map{|x|b.index(x)}
    puts "fr: #{fr.to_s}" if $debug&2==2
    puts "h: #{h[fr[0]][fr[1]]}" if $debug&2==2
    puts b[h[fr[0]][fr[1]]]
  }

end

if $0 == __FILE__ then
  main
end