#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>

int a[1000005];
namespace qyl{
    int prime[1000005];
    bool flag[10000005];
    int cnt = 0;
    void init(){
        flag[0] = flag[1] = true;
        for(int i = 2; i <= 10000000; i++){
            if(!flag[i])
                prime[++cnt] = i;
            for(int j = 1; j <= cnt && i * prime[j] <= 10000000; j++){
                flag[i * prime[j]] = true;
                if(i % prime[j] == 0)
                    break;
            }
        }
        return ;
    }
    #define is(x) (x <= 1e7 && !flag[x])
    class tree{
        protected:
            struct Node{
                int sum, tag, sz;
            };
        public:
            #define sum(k) tree[k].sum
            #define tag(k) tree[k].tag
            #define sz(k) tree[k].sz
            Node tree[4000005];
            void build(int k, int l, int r){
                sz(k) = r - l + 1;
                if(l == r){
                    tag(k) = a[l];
                    sum(k) = is(tag(k));
                    return ;
                }
                int mid = l + r >> 1;
                build(k << 1, l, mid);
                build(k << 1 | 1, mid + 1, r);
                sum(k) = sum(k << 1) + sum(k << 1 | 1);
            }
            void lazy(int x, int k){
                sum(x) = sz(x) * is(k);
                tag(x) = k;
                return ;
            }
            void pushdown(int k){
                if(tag(k)){
                    lazy(k << 1, tag(k));
                    lazy(k << 1 | 1, tag(k));
                    tag(k) = 0;
                }
            }
            void update(int l, int r, int x, int v, int k){
                if(l == r){
                    tag(k) += v;
                    sum(k) = is(tag(k));
                    return ;
                }
                pushdown(k);
                int mid = l + r >> 1;
                if(x <= mid) update(l, mid, x, v, k << 1);
                else update(mid + 1, r, x, v, k << 1 | 1);
                sum(k) = sum(k << 1) + sum(k << 1 | 1);
            }
            void modify(int L, int R, int l, int r, int v, int k){
                if(L <= l && r <= R) return lazy(k, v);
                pushdown(k);
                int mid = l + r >> 1;
                if(L <= mid) modify(L, R, l, mid, v, k << 1);
                if(R > mid) modify(L, R, mid + 1, r, v, k << 1 | 1);
                sum(k) = sum(k << 1) + sum(k << 1 | 1);
            }
            int query(int L, int R, int l, int r, int k){
                if(L <= l && r <= R) return sum(k);
                pushdown(k);
                int mid = l + r >> 1, ans = 0;
                if(L <= mid) ans += query(L, R, l, mid, k << 1);
                if(R > mid) ans += query(L, R, mid + 1, r, k << 1 | 1);
                return ans;
            }
    };
};

qyl::tree seg;
int main(){
    qyl::init();
    int n, t;
    std::cin >> n >> t;
    for(int i = 1; i <= n; i++) std::cin >> a[i];
    seg.build(1, 1, n);
    while(t--){
        char ch;
        std::cin >> ch;
        if(ch == 'A'){
            int x, v;
            std::cin >> x >> v;
            seg.update(1, n, x, v, 1);
        } else if(ch == 'R'){
            int l, r, v;
            std::cin >> l >> r >> v;
            seg.modify(l, r, 1, n, v, 1);
        } else {
            int l, r;
            std::cin >> l >> r;
            std::cout << seg.query(l, r, 1, n, 1) << '\n';
        }
    }
    return 0;
}