Enigmatic Device

문제

Yes, it happened! The first contact! Aliens will visit the Earth in 2010! And they promised to bring an enigmatic device which cannot be constructed using existing Earth technologies. Most of the scientists of the world think so! All newspapers already published their leading articles about it. 

This device will accept an integer sequence $\{a_i\}\backslash \{a\_i\backslash \}$ as its initial input. After that, it can perform the following two operations:

1. Take an interval $[l;r][l;\; r]$ and perform $a_i\leftarrow a_i^{2}2010a\_i\; \backslash leftarrow\; a\_i^2\; \backslash bmod\; 2010$ for all $a_{i}a\_i$ such that $l\le i\le rl\; \backslash le\; i\; \backslash le\; r$.
2. Take an interval $[l;r][l;\; r]$ and output the sum of all $a_{i}a\_i$ such that $l\le i\le rl\backslash le\; i\backslash le\; r$. Note that the sum is not taken modulo 2010.

The amazing thing about this device is that it is able to perform $5000050\backslash ,000$ operations of this kind with a sequence of $5000050\backslash ,000$ numbers within 3 seconds. Nobody could do it before!

But Roman does not believe in aliens and thinks that it is only a great hoax made by somebody just to win another million bucks on the stock exchange. His goal is to prove this. So he hired you to write a program to simulate this device.

Given an integer sequence $a_{i}a\_i$ and a sequence of operations, write a program which simulates the behaviour of the strange alien device.

입력

The first line of the input contains the length of the sequence $nn$ ($1\le n\le 500001\backslash le\; n\backslash le\; 50\backslash ,000$). The second line contains $nn$ numbers $a_{i}a\_i$ forming the initial sequence ($0\le a_i\le 20090\backslash le\; a\_i\backslash le\; 2009$). The third line contains the number of operations $mm$ ($1\le m\le 500001\backslash le\; m\backslash le\; 50\backslash ,000$). The rest of file contains $mm$ lines, each describing one operation. The $jj$-th operation is described by its kind $k_{j}k\_j$ (1 for squaring, 2 for calculating the sum), followed by two integers $l_{j}l\_j$ and $r_{j}r\_j$ ($1\le l_j\le r_j\le n1\backslash le\; l\_j\; \backslash le\; r\_j\backslash le\; n$).

출력

For each operation of the second kind, write their output on the separate line, in order they appear in the input.

3
17 239 999
4
2 1 3
1 2 3
2 2 3
2 1 2

1255
1882
858