Problem: Mike and some bears are playing a game just for fun. Mike is the judge. All bears except Mike are standing in an n × m grid, there's exactly one bear in each cell. We denote the bear standing in column number j of row number i by (i, j). Mike's hands are on his ears (since he's the judge) and each bear standing in the grid has hands either on his mouth or his eyes.

<image>

They play for q rounds. In each round, Mike chooses a bear (i, j) and tells him to change his state i. e. if his hands are on his mouth, then he'll put his hands on his eyes or he'll put his hands on his mouth otherwise. After that, Mike wants to know the score of the bears.

Score of the bears is the maximum over all rows of number of consecutive bears with hands on their eyes in that row.

Since bears are lazy, Mike asked you for help. For each round, tell him the score of these bears after changing the state of a bear selected in that round. 

Input

The first line of input contains three integers n, m and q (1 ≤ n, m ≤ 500 and 1 ≤ q ≤ 5000).

The next n lines contain the grid description. There are m integers separated by spaces in each line. Each of these numbers is either 0 (for mouth) or 1 (for eyes).

The next q lines contain the information about the rounds. Each of them contains two integers i and j (1 ≤ i ≤ n and 1 ≤ j ≤ m), the row number and the column number of the bear changing his state.

Output

After each round, print the current score of the bears.

Examples

Input

5 4 5
0 1 1 0
1 0 0 1
0 1 1 0
1 0 0 1
0 0 0 0
1 1
1 4
1 1
4 2
4 3


Output

3
4
3
3
4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        InputReader in = new InputReader();
        PrintWriter out = new PrintWriter(System.out);
        int test_cases = 1;
        Solver s = new Solver();
        for (int i = 1; i <= test_cases; i++) {
            s.solve(i, in, out);
        }
        out.close();
    }
}

class Solver {
    int[][] a;
    int[] mx;
    int[] tree;
    void solve(int test_number, InputReader in, PrintWriter out) throws IOException {
        int n = in.nextInt();
        int m = in.nextInt();
        int queries = in.nextInt();
        a = new int[n + 1][m + 1];
        tree = new int[(4 * (n + 1))];
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                a[i][j] = in.nextInt();
            }
        }
        mx = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            int mm = -1, c = 0;
            for (int j = 1; j <= m; j++) {
                if (a[i][j] == 0) c = 0;
                else c++;
                mm = Math.max(mm, c);
            }
            mx[i] = mm;
        }
        int curr_max = -1;
        for (int i = 1; i <= n; i++) curr_max = Math.max(curr_max, mx[i]);
//        build(1, 1, n);
//        for (int i = 1; i <= n; i++) out.println(mx[i]);
        for (int qq = 0; qq < queries; qq++) {
            int x = in.nextInt();
            int y = in.nextInt();
            a[x][y] = (a[x][y] + 1) % 2;
            int fm = findMax(x);
            if (fm != mx[x]) {
                mx[x] = fm;
                curr_max = -1;
                for (int i = 1; i <= n; i++) curr_max = Math.max(curr_max, mx[i]);
            }
            out.println(curr_max);
        }
    }

    private int findMax(int x) {
        int mm = -1, c = 0;
        for (int j = 1; j < a[x].length; j++) {
            if (a[x][j] == 0) c = 0;
            else c++;
            mm = Math.max(mm, c);
        }
        return mm;
    }

    void build(int node, int start, int end)
    {
        if(start == end)
        {
            tree[node] = mx[start];
        }
        else
        {
            int mid = (start + end) / 2;
            build(2*node, start, mid);
            build(2*node+1, mid+1, end);
            tree[node] = Math.max(tree[2*node], tree[2*node+1]);
        }
    }

    int query(int node, int start, int end, int l, int r)
    {
        if(r < start || end < l)
        {
            return 0;
        }
        if(l <= start && end <= r)
        {
            return tree[node];
        }
        int mid = (start + end) / 2;
        int p1 = query(2*node, start, mid, l, r);
        int p2 = query(2*node+1, mid+1, end, l, r);
        return Math.max(p1, p2);
    }

    void update(int node, int start, int end, int idx, int val)
    {
        if(start == end)
        {
            mx[idx] = val;
            tree[node] = val;
        }
        else
        {
            int mid = (start + end) / 2;
            if(start <= idx && idx <= mid)
            {
                update(2*node, start, mid, idx, val);
            }
        else
            {
                update(2*node+1, mid+1, end, idx, val);
            }
            tree[node] = Math.max(tree[2*node], tree[2*node+1]);
        }
    }
}


class InputReader {
    BufferedReader br;
    StringTokenizer st;

    public InputReader()
    {
        br = new BufferedReader(new
                InputStreamReader(System.in));
    }

    String next()
    {
        while (st == null || !st.hasMoreElements())
        {
            try
            {
                st = new StringTokenizer(br.readLine());
            }
            catch (IOException  e)
            {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt()
    {
        return Integer.parseInt(next());
    }

    long nextLong()
    {
        return Long.parseLong(next());
    }

    double nextDouble()
    {
        return Double.parseDouble(next());
    }

    String nextLine()
    {
        String str = "";
        try
        {
            str = br.readLine();
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }
        return str;
    }
}