Phoenix loves playing with bits — explicitly, by utilizing the bitwise tasks AND, OR, and XOR. He has n integers a1,a2,… ,an, and will perform q of the accompanying questions: supplant all numbers simulated intelligence where l≤ai≤r with simulated intelligence AND x; supplant all numbers simulated intelligence where l≤ai≤r with simulated intelligence OR x;
Correct answer will be upvoted else downvoted. Computer science.
Phoenix loves playing with bits — explicitly, by utilizing the bitwise tasks AND, OR, and XOR. He has n integers a1,a2,… ,an, and will perform q of the accompanying questions:
supplant all numbers simulated intelligence where l≤ai≤r with simulated intelligence AND x;
supplant all numbers simulated intelligence where l≤ai≤r with simulated intelligence OR x;
supplant all numbers man-made intelligence where l≤ai≤r with
output the number of unmistakable integers artificial intelligence where l≤ai≤r.
For each question, Phoenix is given l, r, and x. Note that he is thinking about the upsides of the numbers, not their files.
Input
The principal line contains two integers n and q (1≤n≤2⋅105; 1≤q≤105) — the number of integers and the number of inquiries, separately.
The subsequent line contains n integers a1,a2,… ,an (0≤ai<220) — the integers that Phoenix begins with.
The following q lines contain the questions. For each question, the primary integer of each line is t (1≤t≤4) — the sort of inquiry.
Assuming t∈{1,2,3}, three integers li, ri, and xi will follow (0≤li,ri,xi<220; li≤ri).
In any case, if t=4, two integers li and ri will follow (0≤li≤ri<220).
It is ensured that there is somewhere around one question where t=4.
Output
Print the response for each question where t=4.
Step by step
Solved in 3 steps with 1 images
