4. Отсеки летающей тарелки

import java.util.*;

public class C {

    private static long binPow(long a, long n, long m) {
        if (n == 0) {
            return 1;
        }
        if (n == 1) {
            return a % m;
        }
        if (n % 2 == 0) {
            long c = binPow(a, n / 2, m) % m;
            return (c * c) % m;
        } else {
            return (binPow(a, n - 1, m) * a) % m;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong(), m = sc.nextLong();
        long ans = binPow(3, n, m) - 1;
        if (ans < 0) ans += m;
        System.out.print(ans);
    }
}