// Go in my style.
// Not afraid to dark.

#include <bits/stdc++.h>
using namespace std;

clock_t sttime;
#define STCLOCK sttime = clock ();
#define TIMENOW fprintf (stderr, "\nNOW TIME COSSEMED: %0.4lf\n", 1.0 * (clock () - sttime) / CLOCKS_PER_SEC);
#define inline __inline__ __attribute__ ((always_inline))

namespace io {
    int read_pos, read_dt; char read_char;
    inline int read (int &p = read_pos){
        p = 0, read_dt = 1; read_char = getchar ();
        while (! isdigit (read_char)){
            if (read_char == '-')
                read_dt = - 1;
            read_char = getchar ();
        }
        while (isdigit (read_char)){
            p = (p << 1) + (p << 3) + read_char - 48;
            read_char = getchar ();
        }
        return p = p * read_dt;
    }
    int write_sta[65], write_top;
    inline void write (long long x){
        if (x < 0)
            putchar ('-'), x = - x;
        write_top = 0;
        do
            write_sta[write_top ++] = x % 10, x /= 10;
        while (x);
        while (write_top)
            putchar (write_sta[-- write_top] + 48);
    }
}

const int N = 1e6;
int n, sed, s[N + 5], nex[55], pos[55];
int tot;
struct trie {
    int to[2], cnt;
    char v;
} tr[N * 40 + 5];

inline int geto (int i, int j){
    if (! tr[i].to[j])
        tr[i].to[j] = ++ tot, tr[tot].v = tr[i].v + 1;
        tr[tot].cnt = tr[tot].to[0] = tr[tot].to[1] = 0;
    return tr[i].to[j];
}

inline void ins (int *s, int n){
    static int nex[55], pos[55];
    nex[1] = nex[0] = 0;
    pos[1] = geto (0, s[1]);
    ++ tr[pos[1]].cnt;
    for (int i = 2;i <= n;++ i){
        pos[i] = geto (pos[i - 1], s[i]);
        nex[i] = nex[i - 1];
        while (nex[i] > 0 && s[nex[i] + 1] != s[i]) nex[i] = nex[nex[i]];
        if (s[nex[i] + 1] == s[i]) ++ nex[i];
        tr[pos[i]].v = i - nex[i];
        ++ tr[pos[i]].cnt;
        // printf ("(%d %d)", nex[i], tr[pos[i]].v);
    }
    // puts ("");
}

signed main (){
    STCLOCK

    io::read (n), io::read (sed);
    for (int i = 1;i <= n;++ i){
        sed = (13331ll * sed + 23333) % 1000000007;
        s[i] = sed & 1;
        // printf ("%d", s[i]);
    }
    // puts ("");
    tr[0].to[0] = tr[0].to[1] = tr[0].cnt = tr[0].v = 0;
    for (int i = 1;i <= n;++ i) ins (s + i - 1, min (50, n - i + 1));
    long long ans = 0;
    for (int i = 0;i <= tot;++ i) ans += 1ll * tr[i].cnt * (tr[i].cnt - 1) / 2 * tr[i].v;
    io::write (ans), putchar ('\n');

    TIMENOW
    return 0;
}