#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	long long ans = 0;
	vector<int>mod = { 1 % n,1 % n };
	while (true) {
		int p = mod[mod.size() - 2];
		int q = mod[mod.size() - 1];
		int r = (p + q) % n;
		if (q == 1 % n && r == 1 % n) {
			mod.pop_back();
			break;
		}
		mod.push_back(r);
	}
	//cout << mod.size() << endl;
	// f_{0}+f_{1}+.....f{n} = f_{n+2}-1
	// Σf_{i} {i∈[l,r)} = f_{r+1}-f_{l+1}
	map<int, long long>mp;
	rep(i, mod.size()) {
		// 1<=x<=m-1に対して
		int cnt = (m - 1) / mod.size();
		if (i <= (m - 1) % mod.size())cnt++;
		if (i == 0)cnt--;
		mp[mod[i]] += cnt;
	}
	for (auto[_, v] : mp)ans += v * (v - 1) / 2;
	if (m >= 3 && !mod[(m - 1) % mod.size()])ans++;
	if (m >= 2 && !mod[(m - 1) % mod.size()])ans++;
	//if (m >= 2 && !mod[(m - 2) % mod.size()])ans++;
	cout << ans << endl;
	return 0;
}