#include <bits/stdc++.h>
using namespace std;
int main(){
	int N,M,T=-1,MAX=1e9;
	cin>>N>>M;
	if(M==1){
		if(N==1)cout<<1;
		else cout<<0;
		return 0;
	}
	vector<int> F(3);
	vector<int64_t>R(N,0),RR(N,0);
	F[0]=F[1]=F[2]=1;
	for(int i=3;i<MAX;i++){
		F.push_back((F[i-1]+F[i-2])%N);
		if(F[i-1]==0&&F[i]==1){
			T=i-1;
			break;
		}
	}
	F.push_back(1);
	for(int i=1;i<=T;i++){
		R[(F[i+2]-1+N)%N]++;
	}
	int64_t K=(M-2)/T,r=(M-2)%T;
	
	for(int i=1;i<=r;i++){
		RR[(F[i+2]-1+N)%N]++;
	}
	RR[0]++;
	int64_t ans=0;
	for(int i=0;i<N;i++){
		R[i]*=K;
		R[i]+=RR[i];
		ans+=R[i]*(R[i]-1)/2;
	}
	if(F[(M-1)%T]%N==0)ans++;
	if(F[M%T]%N==0)ans+=2;
	cout<<ans<<endl;
}