#include <bits/stdc++.h>
#define F(i, j, k) for(int i = j; i <= k; i++)
#define int long long
using namespace std;
const int N = 1000005, M = 41;
int n, sd, a[N], cnt[N][M + 5], t, ans, hs[N], k[N], v[N], h[N], ne[N], c;
int add(int x){
	int t = x % 999987;
	for(int i = h[t]; ~i; i = ne[i]) if(k[i] == x) return v[i]++;
	return ne[++c] = h[t], h[t] = c, k[c] = x, v[c] = 1, 0;
}
void clr(){ memset(h, -1, sizeof h), c = 0;}
signed main(){
	cin >> n >> sd;
	F(i, 1, n) sd = (sd * 13331 + 23333) % 1000000007, a[i] = sd & 1;
	F(i, 1, M){ clr(); F(j, i, n) cnt[j][i] = add(hs[j] = hs[j] * 2 + a[j - i + 1]);}
	F(i, 1, n){
		F(j, 1, min(i, M)) hs[j] = hs[j - 1] * 2 + a[i - j + 1]; t = 0;
		for(int j = M; j; j--) if(cnt[i][j]){
			F(k, j + 1, t) if(hs[j] == (hs[k] & (1 << j) - 1)) cnt[i][j] -= cnt[i][k];
			ans += cnt[i][j] * j, t = !t? j: t;
		}
	}
	cout << ans;
	return 0;
}