keuvyn carlos

me ajudem nessa questão está me matando... The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are de ned by the recurrence: F0 = 0 F1 = 1 Fi = Fi-1 + Fi-2 for i>1 write a program which calculates Mn = Fn mod 2 elevado a m for given pair of n and m 0<= m <= 2147483647 and 0 <= m < 20 Note that a mod b gives the remainder when a is divided by b. Input Input consists of several lines specifying a pair of n and m. Output Output should be corresponding Mn, one per line. SampleInput 11 7 11 6 SampleOutput 89 25