Linear cellular automaton is an infinite sequence of cells,
each holding either 0 or 1.
Cells are indexed with integers,
extending from some chosen "zero" cell in both
positive and negative directions.

In the initial (first) state all except the finite number of cells contain 0.
Next state is computed from previous one by a simple rule:
new cell value is 1 if the cell had exactly one neighbour with value 1, otherwise 0.

Although computing states is easy and fast,
researchers are often interested in states after very many steps.
Because these states may occupy large amount of memory,
only parts of them are usually printed.

Your program must, given the initial state,
quickly find values for S-th state for cells with indexes F, F + 1, …, F + L − 1.

Input file format

Input file contains number of non-zero cells in the initial state N,
followed by their indexes i_{1}i_{2}… i_{N}, and then integers SFL.
All indexes are different.

Output file format

Output file must contain L values, each of them either 0 or 1.

Constraints

1 ≤ S ≤ 10^{9}, − 10^{9} ≤ F ≤ 10^{9}, 1 ≤ L, N ≤ 2000, − 1000 ≤ i_{k} ≤ 1000