A full

module First where

another :: Int -> Int -> Int
another b q = case (mod q b) of
              0 -> another b (div q b)
              _ -> q

cycled :: Int -> Int -> (Int, Int)
cycled b q = case b of
            1 -> (b, q)
            _ -> let nq = another b q in cycled (gcd nq b) nq

answer :: Int -> Int -> Int -> String
answer p q b = let g = gcd p q in
               let q2 = div q g in
               let b2 = gcd q2 b in
               let (fb, fq) = cycled b2 q2 in
               case fq of
               1 -> "Finite"
               _ -> "Infinite"


doTest :: Int -> [Int] -> [String]
doTest n list = if n > 0 && length list > 2
                then let p:q:b:xlist = list in (answer p q b):(doTest (n - 1) xlist)
                else []

doAll :: [String] -> [String]
doAll inp = let q = map read inp in
    case q of
    [] -> []
    x:xs -> doTest x xs

main :: IO ()
main = interact $ unlines . doAll . words
--main = print (unlines $ doAll $ words "1 5 6 10")