Mike is the president of country What-The-Fatherland. There are *n* bears living in this country besides Mike. All of them are standing in a line and they are numbered from 1 to *n* from left to right. *i*-th bear is exactly *a*<sub class="lower-index">*i*</sub> feet high. 

A group of bears is a non-empty contiguous segment of the line. The size of a group is the number of bears in that group. The strength of a group is the minimum height of the bear in that group.

Mike is a curious to know for each *x* such that 1 ≤ *x* ≤ *n* the maximum strength among all groups of size *x*.
The first line of input contains integer *n* (1 ≤ *n* ≤ 2 × 10<sup class="upper-index">5</sup>), the number of bears.

The second line contains *n* integers separated by space, *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>), heights of bears.
def func(a):
    s=0
    per= 0
    for i in range(len(a)):
        if a[i] == '1':

            per+=1
        else:
            s=max(s, per)
            per=0
    s=max(per, s)
    return s
def main(a):

    A= []
    B = [0] * int(a[0])
    for i in range(int(a[0])):
        A.append(input().split())
    for i in range(int(a[0])):
        B[i] = func(A[i])
    for i in range(int(a[2])):
        s = 0
        k = input().split()
        A[int(k[0]) - 1][int(k[1]) - 1] = str((int(A[int(k[0]) - 1][int(k[1]) - 1]) + 1) % 2)
        B[int(k[0]) - 1] = func(A[int(k[0]) - 1])
        for i in B:
            s = max(s, i)
        print(s)
a=input().split()
func(main(a))