#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = ;

int n, m;

struct seg {

    ll tag[N << ], tree[N << ][];

    void pushdown(int x, int l, int r)

    {

        if(!tag[x]) return;

        tag[x << ] += tag[x];

        tag[x <<  | ] += tag[x];

        int mid = (l + r) >> ;

        tree[x << ][] += tag[x] * (ll)(mid - l + 1ll);

        tree[x <<  | ][] += tag[x] * (ll)(r - mid);

        tree[x << ][] += tag[x] * (ll)(l + mid) * (ll)(mid - l + ) / 2ll;

        tree[x <<  | ][] += tag[x] * (ll)(r + mid + 1ll) * (ll)(r - mid) / 2ll;

        tree[x << ][] += tag[x] * ((ll)mid * (ll)(mid + 1ll) * (ll)(2ll * mid + 1ll) - (ll)(l - 1ll) * (ll)l * (ll)(2ll * l - 1ll)) / 6ll;

        tree[x <<  | ][] += tag[x] * ((ll)r * (ll)(r + 1ll) * (ll)(2ll * r + 1ll) - (ll)mid * (ll)(mid + 1ll) * (ll)(2ll * mid + 1ll)) / 6ll;

        tag[x]= 0ll;

    }

    void update(int l, int r, int x, int a, int b, ll delta)

    {

        if(l > b || r < a) return;

        if(l >= a && r <= b)

        {

            tag[x] += delta;

            tree[x][] += (ll)(r - l + 1ll) * delta;

            tree[x][] += (ll)(l + r) * (ll)(r - l + ) / 2ll * delta;

            tree[x][] += ((ll)r * (ll)(r + 1ll) * (2ll * r + ) - (ll)(l - 1ll) * (ll)l * (ll)(2ll * l - 1ll)) / 6ll * delta;

            return;

        }

        pushdown(x, l, r);

        int mid = (l + r) >> ;

        update(l, mid, x << , a, b, delta);

        update(mid + , r , x <<  | , a, b, delta);

        for(int i = ; i <= ; ++i)

            tree[x][i] = tree[x << ][i] + tree[x <<  | ][i];

    }

    ll query(int l, int r, int x, int a, int b, int type)

    {

        if(l > b || r < a) return 0ll;

        if(l >= a && r <= b) return tree[x][type];

        pushdown(x, l, r);

        int mid = (l + r) >> ;

        return (query(l, mid, x << , a, b, type) + (query(mid + , r, x <<  | , a, b, type)));

    }

} t;

ll gcd(ll a, ll b)

{

    return !b ? a : gcd(b, a % b);

}

int main()

{

//    freopen("c.in", "r", stdin);

//    freopen("c.out", "w", stdout);

    scanf("%d%d", &n, &m);

    --n;

    while(m--)

    {

        char s[]; int l, r; ll delta; scanf("%s", s);

        if(s[] == 'C')

        {

            scanf("%d%d%lld", &l , &r, &delta);

            --r;

            t.update(, n, , l, r, delta);

        }

        if(s[] == 'Q')

        {

            scanf("%d%d", &l, &r);

            --r;

            ll T1 = t.query(, n, , l, r, );

            ll T2 = t.query(, n, , l, r, );

            ll T3 = t.query(, n, , l, r, );

            ll ans = (ll)(1ll - l) * (ll)(r + 1ll) * T1 + (ll)(r + l) * T2 - T3;

            ll T4 = (ll)(r - l + 2ll) * (ll)(r - l + 1ll) / 2ll;

            ll T = gcd(ans, T4);

            printf("%lld/%lld\n", ans / T, T4 / T);

        }

    }

//    fclose(stdin); fclose(stdout);

    return ;

}