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

import scala.io.StdIn._
import scala.annotation.tailrec

object Main {

  object Dice{
    private val northPer = List(2,6,3,4,1,5).map(_ - 1)
    private val eastPer = List(4,2,1,6,5,3).map(_ - 1)
    private val ccwPer = List(1,4,2,5,3,6).map(_ - 1)

    type Per = List[Int]
    type Rot = Dice => Dice

    def rot(dice: Dice, perm: Per):Dice = Dice(perm.map(dice.pip))

    def foldLeft(dice: Dice, perm: Per, n:Int = 4, f:(Dice,Per)=>Dice = rot):Dice =
      if(n<=0) dice else foldLeft(f(dice,perm),perm,n-1,f)

    def rev(dice: Dice, perm: Per):Dice = foldLeft(dice,perm)

    def axial(d: Dice,f: Rot): List[Dice] = List(d,f(d),f(f(d)),f(f(f(d))))

    def north(d: Dice) = rot(d,northPer)
    def east(d: Dice) = rot(d,eastPer)
    def ccw(d: Dice) = rot(d,ccwPer)

    def south(d: Dice) = rev(d,northPer)
    def west(d: Dice) = rev(d,eastPer)
    def cw(d: Dice) = rev(d,ccwPer)

    def vertical(d: Dice): List[Dice] = axial(d, north)
    def horizontal(d: Dice): List[Dice] = axial(d, east)
    def turn(d: Dice): List[Dice] = axial(d, ccw)

    def enumerateTop(d: Dice, n: Int = 6): List[Dice] = {
      if(n<=0)List[Dice]()
      else d :: enumerateTop(if(n%2==0) north(d) else east(d), n-1)
    }

    def enumerate(d: Dice): List[Dice] = enumerateTop(d).flatMap(turn)
  }

  case class Dice(pip: List[Int] = List(1,2,3,4,5,6)) {

    def rotate(com: Char):Dice = com match {
      case 'N' => Dice.north(this)
      case 'E' => Dice.east(this)
      case 'S' => Dice.south(this)
      case 'W' => Dice.west(this)
      case _ => this
    }
  }

  @tailrec
  def loop(n:Int, all: List[Dice]):Unit = if(n>0){
    val Array(a,b,_*) = readLine.split(" ").map(_.toInt)
    val res = all.filter(d => d.pip(0)==a && d.pip(1)==b)
    println(res(0).pip(2))
    loop(n-1,all)
  }

  def main(args: Array[String]): Unit = {
    val pip = readLine.split(" ").map(_.toInt).toList
    val all: List[Dice] = Dice.enumerate(Dice(pip))
    val Array(n,_*) = readLine.split(" ").map(_.toInt)
    loop(n,all)
  }
}