/* C++ */ #include using namespace std; typedef long long int ll; typedef long double ld; typedef vector vl; typedef vector> vvl; typedef vector>> vvvl; typedef pair pint; const ll MOD = 1000000007; const ll INF = 922337203685477580; #define rep(i, n) for(ll i = (ll)0; i < (ll)(n); i++) #define Rep(i, s, t) for(ll i = (ll)(s); i < (ll)(t); i++) #define ALL(a) (a).begin(),(a).end() #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define PI 3.14159265358979323846 #define ifYN(x) cout << (x ? "Yes" : "No") << "\n" ll dx[4] = {-1, 1, 0, 0}; ll dy[4] = {0, 0, -1, 1}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } ll Len(ll n) { if (n == 0) return 1; ll s = 0; while (n != 0) s++, n /= 10; return s; } ll Sint(ll n) { ll ans = 0; while (n != 0) ans += n % 10, n /= 10; return ans; } ll Svec(vector v){ ll n = 0; rep(i, (ll)v.size()) n += v[i]; return n; } ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; } ll LCM(ll a, ll b){ return a / GCD(a, b) * b; } ll POW(ll a, ll n, ll mod = INF) { ll res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } void dis(vector v){ rep(i, v.size()) cout << v[i] << endl; } void dis2(vector > v) { rep (i, v.size()) { rep (j, v[0].size()) cout << v[i][j] << ' '; cout << endl; } } bool cmp(pint a, pint b) { return a.second < b.second; } void MATPOW(vector &dp, vector> &mat, ll k, ll MOD) { ll N = mat.size(); while (k > 0) { if (k & 1) { vector ret(N, 0); rep (i, N) rep (j, N) ret[i] += mat[i][j] * dp[j], ret[i] %= MOD; dp = ret; } vector> ret(N, vector(N, 0)); rep (i, N) rep (j, N) rep (k, N) ret[i][j] += mat[i][k] * mat[k][j], ret[i][j] %= MOD; mat = ret; k >>= 1; } return; } /*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/ int main() { IOS; ll N, M; cin >> N >> M; vector dp = {0, 1}; vector> mat = {{1, 1}, {1, 0}}; MATPOW(dp, mat, N - 1, M); cout << dp[0] << endl; }