Description

Given a sequence $a_1,a_2,a_3,\dots,a_n$ of length $n$.

Now you need to compute a sequence $b_1,b_2,b_3,\dots,b_n$ of length $n$, satisfying

Due to some mysterious reasons, each $b_k$ should be taken modulo $2^{32}$.

Input Format

To avoid overly large input, this problem uses a random number generator.

The input contains only one line with two integers $n, seed$. Here, $seed$ is a $32$-bit unsigned integer used to generate the data.

Next, you need to call the random number generator $n$ times to generate $a_1 \sim a_n$.

For C/C++ users, the generator template is as follows:

#define uint unsigned int
uint seed;
inline uint getnext(){
	seed^=seed<<13;
	seed^=seed>>17;
	seed^=seed<<5;
	return seed;
}

For Pascal users, the generator template is as follows:

var seed:dword;
function getnext:dword;
begin
	seed:=seed xor(seed shl 13);
	seed:=seed xor(seed shr 17);
	seed:=seed xor(seed shl 5);
	getnext:=seed;
end;

Note: All $n$ numbers are $32$-bit unsigned integers.

Output Format

To avoid overly large output, you only need to output one $32$-bit unsigned integer, which is the XOR sum of all $b_i$.

5 1477

2608816472

Hint

In the sample, the sequence $a$ is $397153977, 974453892, 352446086, 334987182, 2086335567$.

The sequence $b$ is $397153977, 1371607869, 749600063, 1706595051, 2483489544$.

Constraints and Conventions

For $100\%$ of the testdata, $1\leq n\leq 2\times 10^7$, $0\leq seed< 2^{32}$.

Translated by ChatGPT 5