#include<bits/stdc++.h> namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include<atcoder/all> #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair<int,int>; using VI = vector<int>; using VVI = vector<VI>; using VL = vector<ll>; using VVL = vector<VL>; using mint = static_modint<2013265921>; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; int f0 = 0, f1 = 1; VI a; do { a.emplace_back(f0); tie(f0, f1) = pair(f1, (f0 + f1) % n); } while (pair(f0, f1) != pair(0, 1 % n)); int p = a.size(); VI s(p + 1); rep(i, p) s[i+1] = (s[i] + a[i]) % n; int q = n / gcd(s[p], n); ll period = (ll)p * q; int cnt = m / period, rest = m % period; VI d1(n); vector<mint> d0(n); rep(i, p) d0[s[i]]++; { vector<mint> d(n); int now = 0; rep(_, q) { d[now] += cnt; now = (now + s[p]) % n; } assert(now == 0); int rq = rest / p, rr = rest % p; rep(_, rq) { d[now]++; now = (now + s[p]) % n; } d = convolution(d, d0); assert(ssize(d) == 2 * n - 1); rep(i, 2 * n - 1) d1[i % n] += d[i].val(); rep(i, rr) d1[(now + s[i]) % n]++; } d1[0]--; ll ans = 0; for (int x : d1) ans += (ll)x * (x - 1) / 2; if (m >= 3 && (a[(m - 2) % p] + a[(m - 1) % p]) % n == 0) ans++; if (m >= 2 && a[(m - 1) % p] % n == 0) ans++; if (a[m % p] % n == 0) ans++; cout << ans << '\n'; }