Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Mike and Fun

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMike 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.

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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/13/2018 05:56:50 (d2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|