You are given a table $$$a$$$ of size $$$n \times m$$$, consisting of symbols "R", "G", "B".

Also, given are integers $$$c$$$ ($$$2 \leq c \leq 3$$$) and $$$q$$$, where $$$c$$$ is the number of different symbols that can appear in the table. If $$$c$$$ equals $$$2$$$, only the symbols "R" and "G" are available; if $$$c$$$ equals $$$3$$$, the symbols "R", "G", "B" are available.

You need to change the values of at most $$$q$$$ elements of the table so that there are no pairs of neighboring cells with the same value. Note that if $$$c=2$$$, using the symbol "B" when changing the values of the table cells is prohibited.

It is guaranteed that under the given constraints, there is a way to change the values of at most $$$q$$$ elements of the table so that there are no pairs of neighboring cells with the same value.

Note that there are no additional constraints in the problem.

1. ($$$7$$$ points): $$$n = 1,\ c = 3,\ q = \lfloor \frac{n \cdot m}{2} \rfloor $$$;
2. ($$$7$$$ points): $$$n = 1,\ c = 2,\ q = \lfloor \frac{n \cdot m}{2} \rfloor$$$;
3. ($$$3$$$ points): $$$c = 3,\ q = n \cdot m$$$;
4. ($$$7$$$ points): all rows of table $$$a$$$ are the same, $$$a[1][j] \neq a[1][j+1]$$$ (for $$$1 \leq j \lt m$$$), $$$c = 3$$$, $$$q = \lfloor \frac{n \cdot m}{2} \rfloor$$$;
5. ($$$7$$$ points): all rows of table $$$a$$$ are the same, $$$c = 3$$$, $$$q = \lfloor \frac{n \cdot m}{2} \rfloor$$$;
6. ($$$13$$$ points): $$$c = 3,\ q = \lfloor \frac{2 \cdot n \cdot m}{3} \rfloor $$$;
7. ($$$19$$$ points): $$$c = 3,\ n \leq 5,\ m \leq 100,\ q = \lfloor \frac{n \cdot m}{2} \rfloor$$$;
8. ($$$17$$$ points): $$$c = 2,\ q = \lfloor \frac{n \cdot m}{2} \rfloor$$$;
9. ($$$20$$$ points): $$$c = 3,\ q = \lfloor \frac{n \cdot m}{2} \rfloor$$$.