B'Phoenix loves playing with bits -- specifically, by using the bitwise operations AND, OR, and XOR. He has n integers a_1, a_2, ... , a_n , and will perform q of the following queries: For each query, Phoenix is given l , r , and x . Note that he is considering the values of the numbers, not their indices. The first line contains two integers n and q ( 1 <= n <= 2 cdot 10^5 ; 1 <= q <= 10^5 ) -- the number of integers and the number of queries, respectively. The second line contains n integers a_1, a_2, ... , a_n ( 0 <= a_i < 2^{20} ) -- the integers that Phoenix starts with. The next q lines contain the queries. For each query, the first integer of each line is t ( 1 <= t <= 4 ) -- the type of query. If t in {1, 2, 3 } , then three integers l_i , r_i , and x_i will follow ( 0 <= l_i, r_i, x_i < 2^{20} ; l_i <= r_i ). Otherwise, if t=4 , two integers l_i and r_i will follow ( 0 <= l_i <= r_i < 2^{20} ). It is guaranteed that there is at least one query where t=4 . Print the answer for each query where t=4 . In the first example: '...