#include <cstdio>

#include<iostream>

using namespace std;

//#define int long long

#define si signed

#define sc(x) scanf("%d", &x);

#define P pair<int, int>

int lazy[][];

int sum[][];

int A[];

int n, m;

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

{

    if (lazy[id][x] == )

    {

        lazy[id][x] = ;

        int mid = l + r >> ;

        lazy[id][x << ] ^= ;

        sum[id][x << ] = (mid - l + ) - sum[id][x << ];

        lazy[id][x <<  | ] ^= ;

        sum[id][x <<  | ] = (r - mid) - sum[id][x <<  | ];

    }

    else if (lazy[id][x] == -)

    {

        lazy[id][x] = ;

        int mid = l + r >> ;

        lazy[id][x << ] = -;

        sum[id][x << ] = (mid - l + );

        lazy[id][x <<  | ] = -;

        sum[id][x <<  | ] = (r - mid);

    }

    else if (lazy[id][x] == -)

    {

        lazy[id][x] = ;

        int mid = l + r >> ;

        lazy[id][x << ] = -;

        sum[id][x << ] = ;

        lazy[id][x <<  | ] = -;

        sum[id][x <<  | ] = ;

    }

}

void pushup(int id, int x)

{

    sum[id][x] = sum[id][x << ] + sum[id][x <<  | ];

}

void build(int id, int l, int r, int x)

{

    lazy[id][x] = ;

    if (l == r)

    {

        sum[id][x] = ((A[l] >> id) & );

        return;

    }

    int mid = (l + r) / ;

    build(id, l, mid, x << );

    build(id, mid + , r, x <<  | );

    pushup(id, x);

}

void update(int id, int l, int r, int x, int type, int L, int R)

{

    if (type == )

    {

        // cout<<type<<"type"<<endl;

        if (l >= L && r <= R)

        {

            lazy[id][x] ^= ;

            sum[id][x] = (r - l + ) - sum[id][x];

            //cout<<L<<' '<<R<<endl;

            return;

        }

        pushdown(id, x, l, r);

        int mid = (l + r) >> ;

        if (L <= mid)

            update(id, l, mid, x << , type, L, R);

        if (R > mid)

            update(id, mid + , r, x <<  | , type, L, R);

        pushup(id, x);

    }

    else if (type == )

    {

        if (l >= L && r <= R)

        {

            lazy[id][x] = -;

            sum[id][x] = ;

            return;

        }

        pushdown(id, x, l, r);

        int mid = (l + r) >> ;

        if (L <= mid)

            update(id, l, mid, x << , type, L, R);

        if (R > mid)

            update(id, mid + , r, x <<  | , type, L, R);

        pushup(id, x);

    }

    else

    {

        if (l >= L && r <= R)

        {

            lazy[id][x] = -;

            sum[id][x] = r - l + ;

            return;

        }

        pushdown(id, x, l, r);

        int mid = (l + r) >> ;

        if (L <= mid)

            update(id, l, mid, x << , type, L, R);

        if (R > mid)

            update(id, mid + , r, x <<  | , type, L, R);

        pushup(id, x);

    }

}

int query(int id, int l, int r, int x, int L, int R)

{

    int ans = ;

    if (L <= l && r <= R)

    {

        return sum[id][x];

    }

    pushdown(id, x, l, r);

    int mid = l + r >> ;

    if (L <= mid)

        ans += query(id, l, mid, x << , L, R);

    if (R > mid)

        ans += query(id, mid + , r, x <<  | , L, R);

    return ans;

}

si main()

{

    int T;

    sc(T)

    string s;

    while (T--)

    {

        sc(n) sc(m);

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

            sc(A[i])

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

        {

            build(i, , n-, );

        }

        int l,r,x;

        while (m--)

        {

            cin >> s;

            if (s[] == 'S')

            {

                sc(l) sc(r)

                int ans=;

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

                    ans +=query(i,,n-,,l,r)*(<<i);

                }

                cout<<ans<<'\n';

            }

            else if (s[] == 'X')

            {

                sc(x)

                sc(l) sc(r)

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

                    if((x>>i)&){

                        update(i,,n-,,,l,r);

                    }

                }

            }

            else if (s[] == 'O')

            {

                sc(x)

                sc(l) sc(r)

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

                    if((x>>i)&){

                        update(i,,n-,,,l,r);

                    }

                }

            }

            else

            {

                sc(x)

                sc(l) sc(r)

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

                    if(!((x>>i)&)){

                        update(i,,n-,,,l,r);

                    }

                }

            }

        }

    }

    //system("pause");

}