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

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

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

E. Lucky Arrays

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLittle Maxim loves interesting problems. He decided to share one such problem with you.

Initially there is an array *a*, consisting of *n* zeroes. The elements of the array are indexed, starting from 1. Then follow queries to change array *a*. Each query is characterized by two integers *v*_{i}, *t*_{i}. In the answer to the query we should make the *v*_{i}-th array element equal *t*_{i} (*a*_{vi} = *t*_{i}; 1 ≤ *v*_{i} ≤ *n*).

Maxim thinks that some pairs of integers (*x*, *y*) are good and some are not. Maxim thinks that array *a*, consisting of *n* integers, is lucky, if for all integer *i*, (1 ≤ *i* ≤ *n* - 1) the pair of integers (*a*_{i}, *a*_{i + 1}) — is good. Note that the order of numbers in the pairs is important, that is, specifically, (1, 2) ≠ (2, 1).

After each query to change array *a* Maxim wants to know, how many ways there are to replace all zeroes in array *a* with integers from one to three so as to make the resulting array (without zeroes) lucky. Of course, distinct zeroes can be replaced by distinct integers.

Maxim told you the sequence of queries and all pairs of integers he considers lucky. Help Maxim, solve this problem for him.

Input

The first line contains integers *n* and *m* (1 ≤ *n*, *m* ≤ 77777) — the number of elements in the array and the number of commands.

The next three lines contain matrix *w*, consisting only of zeroes and ones; the *j*-th number in the *i*-th of these lines — *w*_{i, j}. If *w*_{i, j} = 1 (1 ≤ *i*, *j* ≤ 3), then pair (*i*, *j*) is good, otherwise it is not good. Matrix does not have to be symmetric relative to the main diagonal.

Next *m* lines contain pairs of integers *v*_{i}, *t*_{i} (1 ≤ *v*_{i} ≤ *n*, 0 ≤ *t*_{i} ≤ 3) — the queries to change the array.

Output

Print *m* integers — the *i*-th number should equal to the number of ways to replace all zeroes in array *a* (changed after the *i*-th query) by integers from one to three so as to make the resulting array (without zeroes) lucky. Separate the numbers by whitespaces. As the answers can be rather large, print the remainder from dividing them by 777777777.

Examples

Input

3 10

1 1 0

1 0 0

1 1 1

1 1

1 3

2 2

3 0

2 1

3 0

3 1

2 0

3 1

1 0

Output

3

6

1

1

2

2

1

3

3

6

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/16/2018 03:32:53 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|