Problem Description

You are given an array arr consisting of N integers. You are also given a queries. Each query consists of three integers x$,$ y$,$ and z$.$

For each query:

$1.$ Find the largest contiguous subarray B starting from index x$,$ whose v th bit is set.

$2.$ Update each of its elements Bj with BjAZ

Where denotes the bitwise XOR operator,

Your task is to print the total number of updates performed after queries.

Given a $2$D array mat that represents the queries:

mat $[$i$][0]$X

mat$[$i$][1]$ Y

mat$[$i$][2]$ Z

Problem Constraints

Explanation $1$:

$1$st Query $(3,1,4)$:

$(3,5)$ is the largest subarray having the $1$st$-$bit set and starting with index $3.$ Array becomes $[2,4,34,5^4,4]=(2,4,7,1.4).$

$2$nd Query $(2,3,7)$:

$(4)$ is the largest subarray having the $3$rd$-$bit set and starily with index $2.$

Array becomes $[2,4^7.7^4.1,4)=[2,3,3,1,4]$

Explanation $2$:

$1$st Query $(2,1,3)$:

The length of the maximum contiguous subarray that satisfies the given condition is $0,$ so there is no change in the array.

$[$execution time limit$]1$ seconds $($cpp$)$

$[$memory limit$]1$ GB

$[$input$)$ array.integer arr

$[$input$]$ array.array.integer mat

$[$output$]$ integer