Serega loves fun. However, everyone has fun in the unique manner.
Serega has fun by solving query problems. One day Fedor came up with
such a problem.
You are given an array
a
consisting of
n
positive integers and queries to it. The queries can be of two types:
- Make a unit cyclic shift to the right on the segment from
l
to
r
(both borders inclusive). That is rearrange elements of the
array in the following manner: <center
class="tex-equation">
a[l], a[l + 1], ..., a[r - 1], a[r] → a[r], a[l], a[l + 1], ..., a[r - 1].</center>
- Count how many numbers equal to
k
are on the segment from
l
to
r
(both borders inclusive).
Fedor hurried to see Serega enjoy the problem and Serega solved it
really quickly. Let's see, can you solve it?
输入描述:
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements of the array. The second line contains n integers a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ n).
The third line contains a single integer q (1 ≤ q ≤ 105) — the number of queries. The next q lines contain the queries.
As you need to respond to the queries online, the queries will be encoded. A query of the first type will be given in format: 1l'ir'i. A query of the second type will be given in format: 2l'ir'ik'i. All the number in input are integer. They satisfy the constraints: 1 ≤ l'i, r'i, k'i ≤ n.
To decode the queries from the data given in input, you need to perform the following transformations:
li = ((l'i + lastans - 1) mod n) + 1; ri = ((r'i + lastans - 1) mod n) + 1; ki = ((k'i + lastans - 1) mod n) + 1.Where lastans is the last reply to the query of the 2-nd type (initially, lastans = 0). If after transformation li is greater than ri, you must swap these values.
输出描述:
For each query of the 2-nd type print the answer on a single line.
示例1
输入
7<br />6 6 2 7 4 2 5<br />7<br />1 3 6<br />2 2 4 2<br />2 2 4 7<br />2 2 2 5<br />1 2 6<br />1 1 4<br />2 1 7 3<br />8<br />8 4 2 2 7 7 8 8<br />8<br />1 8 8<br />2 8 1 7<br />1 8 1<br />1 7 3<br />2 8 8 3<br />1 1 4<br />1 2 7<br />1 4 5<br />
输出
2<br />1<br />0<br />0<br />2<br />0<br />
