/**************************************************************

     Problem: 2752

     User: Tunix

     Language: C++

     Result: Accepted

     Time:3712 ms

     Memory:16904 kb

 ****************************************************************/

 //BZOJ 2752

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 typedef long long LL;

 inline LL getint(){

     LL r=,v=; char ch=getchar();

     for(;!isdigit(ch);ch=getchar()) if (ch=='-') r=-;

     for(; isdigit(ch);ch=getchar()) v=v*-''+ch;

     return r*v;

 }

 const int N=;

 /*******************template********************/

 int n,m;

 struct node{

     LL num[],ad;

     node(){F(i,,) num[i]=; ad=;}

 }t[N<<];

 node maintain(node L,node R){

     node tmp;

     F(i,,) tmp.num[i]=L.num[i]+R.num[i];

     return tmp;

 }

 #define mid (l+r>>1)

 #define L (o<<1)

 #define R (o<<1|1)

 void upd(int o,LL l,LL r,LL v){

     t[o].ad+=v;

     t[o].num[]+=v*(r-l+);

     t[o].num[]+=v*(r+l)*(r-l+)/;

     t[o].num[]+=v*(r*(r+)*(*r+)-(l-)*l*(*l-))/;//数学没学好QAQ

 }

 void Push_down(int o,int l,int r){

     if (t[o].ad){

         upd(L,l,mid,t[o].ad);

         upd(R,mid+,r,t[o].ad);

         t[o].ad=;

     }

 }

 void update(int o,int l,int r,int ql,int qr,LL v){

     if (ql<=l && qr>=r) upd(o,l,r,v);

     else{

         Push_down(o,l,r);

         if (ql<=mid) update(L,l,mid,ql,qr,v);

         if (qr>mid) update(R,mid+,r,ql,qr,v);

         t[o]=maintain(t[L],t[R]);

     }

 }

 node query(int o,int l,int r,int ql,int qr){

     if (ql<=l && qr>=r) return t[o];

     else{

         Push_down(o,l,r);

         node ans;

         if (ql<=mid) ans=maintain(ans,query(L,l,mid,ql,qr));

         if (qr>mid) ans=maintain(ans,query(R,mid+,r,ql,qr));

         return ans;

     }

 }

 inline LL gcd(LL a,LL b){return b ? gcd(b,a%b) : a;}

 void solve(LL fz,LL fm){

     fm=fm*(fm+)/;

     LL d=gcd(abs(fz),fm);

 //  cout << fz <<" "<<fm<<' '<<d<<endl;

     fz/=d; fm/=d;

     printf("%lld/%lld\n",fz,fm);

 }

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("2752.in","r",stdin);

     freopen("2752.out","w",stdout);

 #endif

     n=getint()-; m=getint();

     char cmd[];

     F(i,,m){

         scanf("%s",cmd);

         LL l=getint(),r=getint()-,v;

         if (cmd[]=='C'){

             v=getint();

             update(,,n,l,r,v);

         }else{

             node ans=query(,,n,l,r);

             LL fz=ans.num[]*(r-l-l*r+)+ans.num[]*(l+r)-ans.num[];

             solve(fz,r-l+);

         }

     }

     return ;

 }