A Taste of Queries

A problem that asks several questions of the same shape is called a query problem. You can answer the queries in the order they are given, and when that is impossible or when the conditions allow it, you can also reorder the queries freely and answer them more comfortably.

Here you are given a sequence of length $n$ and $q$ queries. There are two kinds of queries.

• 1 a b: print the sum of the range $[a, b]$, then swap the $a$-th number and the $b$-th number of the sequence.
• 2 a b c d: print the sum of the range $[a, b]$ minus the sum of the range $[c, d]$.

The sum of the range $[a, b]$ is the total of the $a$-th through $b$-th numbers of the sequence. A type 1 query modifies the sequence, so process the queries in the order they are given.

The first line contains the length of the sequence $n$ ($1 \le n \le 1000$) and the number of queries $q$ ($1 \le q \le 10000$).

The second line contains the $n$ numbers of the sequence, separated by single spaces. Each number is an integer between $-2147483648$ and $2147483647$, inclusive.

Each of the next $q$ lines contains one query, in the form 1 a b or 2 a b c d. The values $a$, $b$, $c$, $d$ are positive integers not greater than $n$, and $a \le b$ and $c \le d$ are guaranteed.

Print the answer to each query on its own line, in the order the queries are given, for a total of $q$ lines.