跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2009. The Child and Sequence

    ID: 2015 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 8 上传者: 标签>数据结构数学挑战难度共享题库Codeforces英文题面题目来源题面语言

The Child and Sequence

题目描述

D. The Child and Sequence
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

At the children's day, the child came to Picks's house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite sequence of Picks.

Fortunately, Picks remembers how to repair the sequence. Initially he should create an integer array a[1],a[2],...,a[n]. Then he should perform a sequence of m operations. An operation can be one of the following:

  1. Print operation l,r. Picks should write down the value of .
  2. Modulo operation l,r,x. Picks should perform assignment a[i]=a[i]modx for each i (lir).
  3. Set operation k,x. Picks should set the value of a[k] to x (in other words perform an assignment a[k]=x).

Can you help Picks to perform the whole sequence of operations?

Input

The first line of input contains two integer: n,m (1≤n,m≤105). The second line contains n integers, separated by space: a[1],a[2],...,a[n](1≤a[i]≤109) − initial value of array elements.

Each of the next m lines begins with a number type .

  • If type=1, there will be two integers more in the line: l,r(1≤lrn), which correspond the operation 1.
  • If type=2, there will be three integers more in the line: l,r,x(1≤lrn;1≤x≤109), which correspond the operation 2.
  • If type=3, there will be two integers more in the line: k,x(1≤kn;1≤x≤109), which correspond the operation 3.
Output

For each operation 1, please print a line containing the answer. Notice that the answer may exceed the 32-bit integer.

Examples
Input
5 5
1 2 3 4 5
2 3 5 4
3 3 5
1 2 5
2 1 3 3
1 1 3
Output
8
5
Input
10 10
6 9 6 7 6 1 10 10 9 5
1 3 9
2 7 10 9
2 5 10 8
1 4 7
3 3 7
2 7 9 9
1 2 4
1 6 6
1 5 9
3 1 10
Output
49
15
23
1
9
Note

Consider the first testcase:

  • At first, a={1,2,3,4,5}.
  • After operation 1, a={1,2,3,0,1}.
  • After operation 2, a={1,2,5,0,1}.
  • At operation 3, 2+5+0+1=8.
  • After operation 4, a={1,2,2,0,1}.
  • At operation 5, 1+2+2=5.

    题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1596 题。保留原作者与原赛事署名。