#!/usr/bin/env python3

from bisect import bisect, bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush
from itertools import accumulate, combinations, combinations_with_replacement, product
from math import atan, cos, degrees, factorial, gcd, inf, pi


mod1 = 10**9 + 7
mod2 = 998244353
dpos4 = ((1, 0), (0, 1), (-1, 0), (0, -1))
dpos8 = ((0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1))


def main():
    N, M = map(int, input().split())

    def matrix_prod(A, B, mod=0):
        ret = [[0] * len(B[0]) for _ in range(len(A))]
        for i in range(len(A)):
            for j in range(len(B[0])):
                for k in range(len(B)):
                    ret[i][j] += A[i][k] * B[k][j]
                    if mod > 0:
                        ret[i][j] %= mod
        return ret

    def matrix_pow(A, K, mod=0):
        if K == 0:
            I = [[0] * len(A[0]) for _ in range(len(A))]
            for i in range(len(A)):
                I[i][i] = 1
            return I
        ret = matrix_pow(matrix_prod(A, A, mod), K // 2, mod)
        if K % 2 == 1:
            ret = matrix_prod(ret, A, mod)
        return ret

    A = [[1, 1], [1, 0]]
    val = matrix_pow(A, N - 1, M)
    print(val[1][0])


if __name__ == "__main__":
    main()