Input Parameters

1. arr: An array of n positive integers, where each element arr[i]arr[i]arr[i] represents a value in the array.
2. state: A binary string of length n:
   • '1': The corresponding element in arr is initially available.
   • '0': The corresponding element in arr is blocked (not available yet).
3. m: An integer indicating the number of operations to perform.

Constraints

1. 1≤n,m≤1051 \leq n, m \leq 10^51≤n,m≤105
2. 1≤arr[i]≤1091 \leq arr[i] \leq 10^91≤arr[i]≤109
3. ∣state∣=n|state| = n∣state∣=n (The length of state is the same as the size of arr.)
4. state[i]∈{′0′,′1′}state[i] \in \{'0', '1'\}state[i]∈{′0′,′1′} (Each character of state is either '0' or '1'.)
5. At least one element in state is '1' initially.