#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>


// Ваня топ


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;

int n;
vector<int> t, mod;

void push(int v, int s) {
    if (mod[v] != INF) {
        t[v] = mod[v] * s;
        mod[2 * v + 1] = mod[v];
        mod[2 * v + 2] = mod[v];
        mod[v] = INF;
    }
}

void update(int v, int l, int r, int askl, int askr, int val) {
    if (l >= askr || r <= askl) return;
    push(v, r - l);
    if (l >= askl && r <= askr) {
        mod[v] = val;
        push(v, r - l);
        return;
    }
    int m = (l + r) / 2;
    update(2 * v + 1, l, m, askl, askr, val);
    update(2 * v + 2, m, r, askl, askr, val);
    t[v] = t[2 * v + 1] + t[2 * v + 2];
}

int get_ans(int v, int l, int r, int askl, int askr) {
    if (l >= askr || r <= askl) return 0;
    push(v, r - l);
    if (l >= askl && r <= askr) {
        return t[v];
    }
    int m = (l + r) / 2;
    int first = get_ans(2 * v + 1, l, m, askl, askr), second = get_ans(2 * v + 2, m, r, askl, askr);
    return first + second;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    freopen("sum.in", "r", stdin);
//    freopen("sum.out", "w", stdout);
    cin >> n;
    t.assign(4 * n, 0);
    mod.assign(4 * n, INF);
    int q;
    cin >> q;
    char w;
    int l, r, val;
    while(q--) {
        cin >> w >> l >> r;
        --l;
        if (w == 'A') {
            cin >> val;
            update(0, 0, n, l, r, val);
        } else cout << get_ans(0, 0, n, l, r) << "\n";
    }
}
/*

*/