How can one efficiently compute the Bitwise AND of a subarray?
Reference Codeforces Round 900 (Div. 3) Problem E