B"DZY loves Fast Fourier Transformation, and he enjoys using it. Fast Fourier Transformation is an algorithm used to calculate convolution. Specifically, if a, b and c are sequences with length n, which are indexed from 0 to n xe2 x80 x89- xe2 x80 x891, and We can calculate c fast using Fast Fourier Transformation. DZY made a little change on this formula. Now To make things easier, a is a permutation of integers from 1 to n, and b is a sequence only containing 0 and 1. Given a and b, DZY needs your help to calculate c. Because he is naughty, DZY provides a special way to get a and b. What you need is only three integers n, d, x. After getting them, use the code below to generate a and b. Operation x % y denotes remainder after division x by y. Function swap(x, y) swaps two values x and y. The only line of input contains three space-separated integers n, xe2 x80 x89d, xe2 x80 x89x (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89d xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100000; 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89x xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000000006). Because DZY is naughty, x can't be equal to 27777500. Output n lines, the i-th line should contain an integer ci xe2 x80 x89- xe2 x80 x891. In the first sample, a is [1 3 2], b is [1 0 0], so c0 xe2 x80 x89= xe2 x80 x89max(1 xc2 xb71) xe2 x80 x89= xe2 x80 x891, c1 xe2 x80 x89= xe2 x80 x89max(1 xc2 xb70, xe2 x80 x893 xc2 xb71) xe2 x80 x89= xe2 x80 x893, c2 xe2 x80 x89= xe2 x80 x89max(1 xc2 xb70, xe2 x80 x893 xc2 xb70, xe2 x80 x892 xc2 xb71) xe2 x80 x89= xe2 x80 x892. In the second sample, a is [2 1 4 5 3], b is [1 1 1 0 1]. In the third sample, a is [5 2 1 4 3], b is [1 1 1 1 0]."...