#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <array>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()	{cin.tie(0);	cout.sync_with_stdio(false);}
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<(int)n;i++)
#define REP(i,n)	for(int i=0;i<=(int)n;i++)
#define srep(i,a,n)	for(int i=a;i<(int)n;i++)
#define SREP(i,a,n)	for(int i=a;i<=(int)n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
#define fst	first
#define scn second
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll sqrt(ll x) {
	ll left = 0, right = x;
	rep(i, 100) {
		ll mid = (left + right) >> 1;
		if (mid*mid <= x)	left = mid;
		else	right = mid;
	}
	return left;
}
ll gcd(ll a, ll b) {
	return a%b == 0 ? b : gcd(b, a%b);
}
#define debug(x)	printf("Case #%d: ", x)
#define DEBUG 0
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };

ll pow2[3030][3030], powpow[3030];
ll dp[3030][3030];
ll nCm[3030][3030];

int main() {
	ll n, m;	cin >> n >> m;
	REP(i, n)	nCm[i][0] = nCm[i][i] = 1;
	SREP(i, 1, n)	SREP(j, 1, n) {
		nCm[i][j] = (nCm[i - 1][j] + nCm[i - 1][j - 1]) % m;
	}
	REP(i, n)	pow2[i][0] = 1;
	pow2[0][1] = 1;
	SREP(i, 1, n)	pow2[i][1] = (pow2[i - 1][1] << 1) % m;
	SREP(i, 2, n)	REP(j, n) {
		pow2[j][i] = (pow2[j][i - 1] * pow2[j][1]) % m;
	}
	powpow[0] = 2;
	SREP(i, 1, n)	powpow[i] = (powpow[i - 1] * powpow[i - 1]) % m;
	// i種類の具材が1杯以下にしか出現せず、それらがj皿に存在する分け方
	// その皿に必ず入れる必要は無いことに注意
	dp[0][0] = 1;
	REP(i, n)	REP(j, i) {
		(dp[i + 1][j] += dp[i][j] * (j+1)) %= m;
		(dp[i + 1][j + 1] += dp[i][j]) %= m;
	}
	ll ret = 0;
	// 1杯以下しか出ない具材の種類数
	REP(i, n) {
		// それらがj杯に乗っている
		REP(j, i) {
			ll add = (nCm[n][i] * dp[i][j]) % m;
			// j杯の上に乗る残りの具材の乗り方
			(add *= pow2[n - i][j]) %= m;
			// 皿を追加しての置き方
			(add *= powpow[n - i]) %= m;
			(ret += (i&1?-1LL:1LL)*add + m) %= m;
		}
	}
	cout << ret << endl;
	return 0;
}

Measured memory_bytes: 215296