/*
    Name:
    Copyright:
    Author:
    Date: 2023/10/3 21:37:32
    Description: 根号分治 
*/
#include<bits/stdc++.h>
using namespace std;
#define for(i,a,b) for (int i = a; i <= b; i++)
const int N = 250001;
int n, m, a[N], b[500][500]; // 400!! 阶梯状 
int main(){
	cin >> n >> m;
	int q = sqrt(n);
	for (i,1,n) {
		scanf("%d", &a[i]);
		for (j,1,q) {
			b[j][i % j] += a[i];
		}
	}
	for (i,1,m) {
		getchar();
		char t = getchar(); 
		int x, y;
		scanf("%d%d", &x, &y);
		if (t == 'A') {
			y %= x;
			if (x <= q) printf("%d\n", b[x][y]);
			else {
				int ans = 0;
				while(y <= n) {
					ans += a[y];
					y += x;
				}
				printf("%d\n", ans);
			}
		}
		else {
			if (x <= q) {
				for(j,1,q) {
					b[j][x % j] += y - a[x];
				}				
			} 
			a[x] = y;
		}
	}
	return 0;
}