#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std; bool MEM;
using ll=long long; using ld=long double;
using pii=pair<int,int>; using pll=pair<ll,ll>;
const int I=1e9;
const ll J=1e18,N=1e6+7,K=50,B=4e7+7;
int n,a[N],t[B][2],sz[B],cnn,nxt[K+7];
ll seed,ans;
void mian() {
	scanf("%d%lld",&n,&seed);
	for (int i=1;i<=n;i++) seed=(seed*13331+23333)%1000000007,a[i]=seed&1;
	for (int l=1;l<=n;l++) {
		int p=0;
		for (int i=1,r=l,j=0;i<=K&&r<=n;i++,r++) {
			if (!t[p][a[r]]) t[p][a[r]]=++cnn;
			p=t[p][a[r]];
			if (i>=2) {
				while (j&&a[l+j]!=a[r]) j=nxt[j];
				if (a[l+j]==a[r]) j++;
				nxt[i]=j;
			}
			ans+=(ll)(i-nxt[i])*sz[p]++;
		}
	}
	cout<<ans;
}
bool ORY; int main() {
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
//	while (1)
//	int t; for (scanf("%d",&t);t--;)
	mian();
	cerr<<"\n"<<abs(&MEM-&ORY)/1048576<<"MB";
	return 0;
}