h :: Integer -> Integer -> Integer
h n m
    | m == 0 = 1
    | (n `mod` 2 == 0) = h ((n) * (n)) (m/2)
    | otherwise   = ((n) ∗ ( h (n) ((m) - (1)) ))