You are given two positive integers $$$X$$$ and $$$Y$$$ of the same length in base 10. Let us define $$$Z$$$ as the positive integer in base 10 satisfying the following conditions.
You have to perform $$$Q$$$ queries. Each query is one of the following:
The digits of an integer are numbered from left to right starting from $$$1$$$. For example, The third digit of $$$1234$$$ is $$$3$$$.
The first line contains two space-separated integers, $$$X$$$ and $$$Y$$$.
The second line contains a single integer $$$Q$$$, the number of queries.
Each of the following $$$Q$$$ lines contains space-separated integers describing the queries. Each line has one of the following forms, where the first integer represents the type of the query:
It is guaranteed that there is at least one query of type 2.
Let $$$\mathrm{len}(A)$$$ be the number of digits in a positive integer $$$A$$$.
For each query of type 2, output a single line with the answer to the query.
3304 1615 6 2 3 2 4 1 1 3 2 2 1 2 4 2 1
3 4 0 3
838046 780357 10 2 1 2 2 1 2 4 2 3 2 4 1 4 5 2 5 2 6 1 1 9 2 2
8 0 3 4 6 8 -1
2950 9052 4 2 1 2 2 2 3 2 4
9 0 5 2
Название |
---|