B'The Free Meteor Association (FMA) has got a problem: as meteors are moving, the Universal Cosmic Descriptive Humorous Program (UCDHP) needs to add a special module that would analyze this movement. UCDHP stores some secret information about meteors as an n xe2 x80 x89 xc3 x97 xe2 x80 x89m table with integers in its cells. The order of meteors in the Universe is changing. That 's why the main UCDHP module receives the following queries: As the main UCDHP module is critical, writing the functional of working with the table has been commissioned to you. The first line contains three space-separated integers n, m and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89500000) -- the number of table columns and rows and the number of queries, correspondingly. Next n lines contain m space-separated numbers each -- the initial state of the table. Each number p in the table is an integer and satisfies the inequality 0 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89p xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106. Next k lines contain queries in the format "si xi yi", where si is one of the characters " xd1 x81", "r" or "g", and xi, yi are two integers. The table rows are considered to be indexed from top to bottom from 1 to n, and the table columns -- from left to right from 1 to m. For each query to obtain a number (si = "g") print the required number. Print the answers to the queries in the order of the queries in the input. Let 's see how the table changes in the second test case. After the first operation is fulfilled, the table looks like that: 2 1 4 1 3 5 After the second operation is fulfilled, the table looks like that: 1 3 5 2 1 4 So the answer to the third query (the number located in the first row and in the third column) will be 5.'...