#include <bits/stdc++.h>
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
using ld = long double;
using ll = long long;
std::mt19937 mt{std::random_device{}()};
template <typename F>
constexpr F PI() { return 3.1415926535897932385; }
template <typename T, std::size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename T, typename A>
std::ostream& operator<<(std::ostream& os, const std::deque<T, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename K, typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::multimap<K, T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::multiset<T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename K, typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::map<K, T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& v) { return (os << "<" << v.first << "," << v.second << ">"); }
template <typename T1, typename T2, typename T3>
std::ostream& operator<<(std::ostream& os, const std::priority_queue<T1, T2, T3>& v)
{
    auto q = v;
    os << "[";
    while (not q.empty()) { os << q.top() << ",", q.pop(); }
    return os << "]\n";
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::queue<T1>& v)
{
    auto q = v;
    os << "[";
    while (not q.empty()) { os << q.front() << ",", q.pop(); }
    return os << "]\n";
}
template <typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::set<T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::stack<T1>& v)
{
    auto q = v;
    os << "[";
    while (not q.empty()) { os << q.top() << ",", q.pop(); }
    return os << "]\n";
}
template <typename K, typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_multimap<K, T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_multiset<T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename K, typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_map<K, T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_set<T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename T, typename A>
std::ostream& operator<<(std::ostream& os, const std::vector<T, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
#define SHOW(...) (std::cerr << "(" << #__VA_ARGS__ << ") = ("), HogeHogeSansuu(__VA_ARGS__), std::cerr << ")" << std::endl;
void HogeHogeSansuu() { ; }
template <typename T>
void HogeHogeSansuu(const T x) { std::cerr << x; }
template <typename T, typename... Args>
void HogeHogeSansuu(const T x, Args... args) { (std::cerr << x << ", "), HogeHogeSansuu(args...); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T PopCount(T v) { return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f); }
template <typename T>
constexpr T log2p1(T v) { return v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), PopCount(v); }
template <typename T>
constexpr bool ispow2(const T v) { return (v << 1) == (T(1) << (log2p1(v))); }
template <typename T>
constexpr T ceil2(const T v) { return ispow2(v) ? v : T(1) << log2p1(v); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : ispow2(v) ? v : T(1) << (log2p1(v) - 1); }
//!===============================================================!//
//!   88888888b            dP       .88888.   a88888b. 888888ba   !//
//!   88                   88      d8'   '88 d8'   '88 88    '8b  !//
//!  a88aaaa    dP.  .dP d8888P    88        88        88     88  !//
//!   88         '8bd8'    88      88   YP88 88        88     88  !//
//!   88         .d88b.    88      Y8.   .88 Y8.   .88 88    .8P  !//
//!   88888888P dP'  'dP   dP       '88888'   Y88888P' 8888888P   !//
//!===============================================================!//
template <typename T>
constexpr std::pair<T, T> extgcd(const T a, const T b)
{
    if (b == 0) { return std::pair<T, T>{1, 0}; }
    const auto p = extgcd(b, a % b);
    return {p.second, p.first - p.second * (a / b)};
}
template <typename T>
constexpr T inverse(const T a, const T mod) { return (mod + extgcd((mod + a % mod) % mod, mod).first % mod) % mod; }
//!===============================================================!//
//!  888888ba  8888ba.88ba                 dP dP            dP    !//
//!  88    '8b 88  '8b  '8b                88 88            88    !//
//!  88     88 88   88   88 .d8888b. .d888b88 88 88d888b. d8888P  !//
//!  88     88 88   88   88 88'  '88 88'  '88 88 88'  '88   88    !//
//!  88    .8P 88   88   88 88.  .88 88.  .88 88 88    88   88    !//
//!  8888888P  dP   dP   dP '88888P' '88888P8 dP dP    dP   dP    !//
//!===============================================================!//
template <typename T>
class DModInt
{
private:
    T value;

public:
    const T mod;  // 正の数を渡すこと！(割り算を使う場合は素数)
    DModInt(const T val, const T mod) : value{((val % mod) + mod) % mod}, mod{mod} { assert(mod > 0); }
    DModInt(const DModInt<T>& n) : value{n()}, mod{n.mod} {}
    DModInt<T>& operator=(const DModInt<T>& n) { return assert(n.mod == mod), value = n(), (*this); }
    DModInt<T>& operator=(const T v) { return value = (mod + v % mod) % mod, (*this); }
    DModInt<T> operator+() const { return *this; }
    DModInt<T> operator-() const { return DModInt{mod - value, mod}; }
    DModInt<T> operator+(const DModInt<T>& val) const { return assert(mod == val.mod), DModInt{value + val(), mod}; }
    DModInt<T> operator-(const DModInt<T>& val) const { return assert(mod == val.mod), DModInt{value - val() + mod, mod}; }
    DModInt<T> operator*(const DModInt<T>& val) const { return assert(mod == val.mod), DModInt{value * val(), mod}; }
    DModInt<T> operator/(const DModInt<T>& val) const { return assert(mod == val.mod), DModInt{value * inverse(val(), mod), mod}; }
    DModInt<T>& operator+=(const DModInt<T>& val) { return assert(mod == val.mod), (((value += val()) %= mod) += mod) %= mod, (*this); }
    DModInt<T>& operator-=(const DModInt<T>& val) { return assert(mod == val.mod), (((value -= val()) %= mod) += mod) %= mod, (*this); }
    DModInt<T>& operator*=(const DModInt<T>& val) { return assert(mod == val.mod), (((value *= val()) %= mod) += mod) %= mod, (*this); }
    DModInt<T>& operator/=(const DModInt<T> val) { return assert(mod == val.mod), (((value *= inverse(val(), mod)) %= mod) += mod) %= mod, (*this); }
    DModInt<T> operator+(const T val) const { return DModInt{value + val, mod}; }
    DModInt<T> operator-(const T val) const { return DModInt{value - val, mod}; }
    DModInt<T> operator*(const T val) const { return DModInt{value * val, mod}; }
    DModInt<T> operator/(const T val) const { return DModInt{value * inverse(val, mod), mod}; }
    template <typename I>
    DModInt<T> operator^(const I n) const { return n < 0 ? (T(1) / (*this)) ^ (-n) : n == 0 ? DModInt{1, mod} : n % 2 == 1 ? (*this) * ((*this) ^ (n - 1)) : ((*this * *this) ^ (n / 2)); }
    DModInt<T>& operator+=(const T val) { return (((value += val) %= mod) += mod) %= mod, (*this); }
    DModInt<T>& operator-=(const T val) { return (((value -= val) %= mod) += mod) %= mod, (*this); }
    DModInt<T>& operator*=(const T val) { return (((value *= val) %= mod) += mod) %= mod, (*this); }
    DModInt<T>& operator/=(const T val) { return (((value *= inverse(val, mod)) %= mod) += mod) %= mod, (*this); }
    template <typename I>
    DModInt<T>& operator^=(const I n) { return (*this) = ((*this) ^ n); }
    bool operator==(const DModInt<T>& val) const { return assert(mod == val.mod), value == val.value; }
    bool operator!=(const DModInt<T>& val) const { return assert(mod == val.mod), not(*this == val); }
    bool operator==(const T val) const { return value == (mod + val % mod) % mod; }
    bool operator!=(const T val) const { return not(*this == val); }
    T operator()() const { return value; }
};
template <typename T>
inline DModInt<T> operator+(const T val, const DModInt<T>& n) { return DModInt<T>{n() + val, n.mod}; }
template <typename T>
inline DModInt<T> operator-(const T val, const DModInt<T>& n) { return DModInt<T>{-n() + val, n.mod}; }
template <typename T>
inline DModInt<T> operator*(const T val, const DModInt<T>& n) { return DModInt<T>{n() * val, n.mod}; }
template <typename T>
inline DModInt<T> operator/(const T val, const DModInt<T>& n) { return DModInt<T>{val, n.mod} / n; }
template <typename T>
inline bool operator==(const T val, const DModInt<T>& n) { return n == val; }
template <typename T>
inline bool operator!=(const T val, const DModInt<T>& n) { return not(val == n); }
template <typename T>
inline std::istream& operator>>(std::istream& is, DModInt<T>& n)
{
    T v;
    return is >> v, n = v, is;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, const DModInt<T>& n) { return (os << n()); }
using dmint = DModInt<int>;
using dmll = DModInt<ll>;
//!===================================================================================!//
//!  888888ba  8888ba.88ba                 dP  a88888b.                     dP        !//
//!  88    '8b 88  '8b  '8b                88 d8'   '88                     88        !//
//!  88     88 88   88   88 .d8888b. .d888b88 88        .d8888b. 88d8b.d8b. 88d888b.  !//
//!  88     88 88   88   88 88'  '88 88'  '88 88        88'  '88 88''88''88 88'  '88  !//
//!  88    .8P 88   88   88 88.  .88 88.  .88 Y8.   .88 88.  .88 88  88  88 88.  .88  !//
//!  8888888P  dP   dP   dP '88888P' '88888P8  Y88888P' '88888P' dP  dP  dP 88Y8888'  !//
//!===================================================================================!//
template <typename T>
class DModComb
{
public:
    DModComb(const std::size_t N, const T mod) : f(N + 1, DModInt<T>(1, mod)), in(N + 1, DModInt<T>(1, mod)), invf(N + 1, DModInt<T>(1, mod))
    {
        for (T i = 2; i <= (T)N; i++) { f[i] = f[i - 1] * i, in[i] = (mod - (mod / i)) * in[mod % i], invf[i] = invf[i - 1] * in[i]; }
    }
    DModInt<T> fact(const std::size_t N) const { return f[N]; }
    DModInt<T> inv(const std::size_t N) const { return in[N]; }
    DModInt<T> invFact(const std::size_t N) const { return invf[N]; }
    DModInt<T> perm(const std::size_t N, const std::size_t K) const { return f[N] * invf[N - K]; }
    DModInt<T> comb(const std::size_t N, const std::size_t K) const { return f[N] * invf[K] * invf[N - K]; }

private:
    std::vector<DModInt<T>> f, in, invf;
};
template <typename T>
constexpr T INF() { return std::numeric_limits<T>::max() / 4; }
//!============================================!//
//!    8888ba.88ba             oo              !//
//!    88  '8b  '8b                            !//
//!    88   88   88  .d8888b.  dP  88d888b.    !//
//!    88   88   88  88'  '88  88  88'  '88    !//
//!    88   88   88  88.  .88  88  88    88    !//
//!    dP   dP   dP  '88888P8  dP  dP    dP    !//
//!============================================!//
int main()
{
    int N;
    ll M;
    std::cin >> N >> M;
    DModComb<ll> mod(N, M);
    dmll minus{0, M};
    for (int B = 0; B <= N; B++) {
        const int R = N - B;
        const auto L = (dmll(2, M) ^ (R * (R - 1) / 2 + B * (B - 1) / 2)) * mod.comb(N, R);
        for (int b = 0; b <= B; b++) {
            const auto T = ((1LL - (dmll(2, M) ^ b)) ^ R) * mod.comb(B, b);
            const auto P = b % 2 == 0 ? T : -T;
            minus += P * L;
        }
    }
    std::cout << (N % 2 == 1 ? -minus : minus) << std::endl;

    return 0;
}



Measured memory_bytes: 3324