{"trustable":false,"sections":[{"title":"","value":{"format":"PLAIN","content":"The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:\nF0 \u003d 0\nF1 \u003d 1\nFi \u003d Fi−1 + Fi−2 for i \u003e 1\nWrite a program which calculates Mn \u003d Fn mod 2m for given pair of n and m. 0 ≤ n ≤ 2147483647\nand 0 ≤ m \u003c 20. Note that a mod b gives the remainder when a is divided by b.\n"}},{"title":"Input","value":{"format":"PLAIN","content":"Input consists of several lines specifying a pair of n and m."}},{"title":"Output","value":{"format":"PLAIN","content":"Output should be corresponding Mn, one per line."}},{"title":"Sample Input","value":{"format":"PLAIN","content":"11 7\n11 6"}},{"title":"Sample Output","value":{"format":"PLAIN","content":"89\n25"}}]}