#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

template <int P>
struct ModInt {
    int v;

    constexpr ModInt() : v(0) {}
    constexpr ModInt(i64 v_) : v(v_ % P) {
        if (v < 0) {
            v += P;
        }
    }
    constexpr explicit operator int() const { return v; }
    constexpr friend ostream& operator<<(ostream &out, ModInt n) {
        return out << int(n);
    }
    constexpr friend istream& operator>>(istream &in, ModInt &n) {
        i64 v;
        in >> v;
        n = ModInt(v);
        return in;
    }

    constexpr friend bool operator==(ModInt a, ModInt b) {
        return a.v == b.v;
    }
    constexpr friend bool operator!=(ModInt a, ModInt b) {
        return a.v != b.v;
    }

    constexpr ModInt operator-() {
        ModInt res;
        res.v = v ? P - v : 0;
        return res;
    }

    constexpr ModInt& operator++() {
        v++;
        if (v == P) v = 0;
        return *this;
    }
    constexpr ModInt& operator--() {
        if (v == 0) v = P;
        v--;
        return *this;
    }
    constexpr ModInt& operator+=(ModInt o) {
        v -= P - o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr ModInt& operator-=(ModInt o) {
        v -= o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr ModInt& operator*=(ModInt o) {
        v = 1LL * v * o.v % P;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt o) { return *this *= o.inv(); }

    constexpr friend ModInt operator++(ModInt &a, int) {
        ModInt r = a;
        ++a;
        return r;
    }
    constexpr friend ModInt operator--(ModInt &a, int) {
        ModInt r = a;
        --a;
        return r;
    }

    constexpr friend ModInt operator+(ModInt a, ModInt b) {
        return ModInt(a) += b;
    }
    constexpr friend ModInt operator-(ModInt a, ModInt b) {
        return ModInt(a) -= b;
    }
    constexpr friend ModInt operator*(ModInt a, ModInt b) {
        return ModInt(a) *= b;
    }
    constexpr friend ModInt operator/(ModInt a, ModInt b) {
        return ModInt(a) /= b;
    }

    constexpr ModInt qpow(i64 p) {
        ModInt res = 1, x = v;
        while (p > 0) {
            if (p & 1) { res *= x; }
            x *= x;
            p >>= 1;
        }
        return res;
    }
    constexpr ModInt inv() {
        return qpow(P - 2);
    }
};

constexpr int P = 998244353;
using Mint = ModInt<P>;

template <int P, int K>
struct ModArray : array<ModInt<P>, K> {
    using Mint = ModInt<P>;
    constexpr ModArray() { this->fill(0); }
    constexpr ModArray(i64 x) { this->fill(x); }
    constexpr ModArray(Mint x) { this->fill(x); }
    constexpr ModArray operator-() {
        ModArray res;
        for (int i = 0; i < K; i++) {
            res[i] = -(*this)[i];
        }
        return res;
    }
    constexpr ModArray& operator+=(ModArray o) {
        for (int i = 0; i < K; i++) {
            (*this)[i] += o[i];
        }
        return *this;
    }
    constexpr ModArray& operator-=(ModArray o) {
        for (int i = 0; i < K; i++) {
            (*this)[i] -= o[i];
        }
        return *this;
    }
    constexpr ModArray& operator*=(ModArray o) {
        for (int i = 0; i < K; i++) {
            (*this)[i] *= o[i];
        }
        return *this;
    }
    constexpr friend ModArray operator+(ModArray a, ModArray b) {
        return ModArray(a) += b;
    }
    constexpr friend ModArray operator-(ModArray a, ModArray b) {
        return ModArray(a) -= b;
    }
    constexpr friend ModArray operator*(ModArray a, ModArray b) {
        return ModArray(a) *= b;
    }
    constexpr friend bool operator<(ModArray a, ModArray b) {
        for (int i = 0; i < K; i++) {
            if (a[i] != b[i]) {
                return a[i].v < b[i].v;
            }
        }
        return false;
    }
};

using Hash = ModArray<P, 2>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    Hash base;
    for (auto &x : base) {
        x = P / 2 + rng() % (P / 4);
    }

    int t;
    cin >> t;

    auto solve = [&]() {
        int n, m;
        cin >> n >> m;

        string s;
        cin >> s;

        vector<Mint> a(n);
        for (int i = 0; i < n; i++) {
            int j = string("()[]{}<>").find(s[i]);
            if (j % 2 == 0) {
                a[i] = j / 2 + 1;
            } else {
                a[i] = -j / 2 - 1;
            }
        }

        vector<int> ql(m), qr(m);
        for (int i = 0; i < m; i++) {
            cin >> ql[i] >> qr[i];
            ql[i]--, qr[i]--;
        }

        int lg = __lg(n);
        vector<Hash> pw(lg + 1);
        pw[0] = base;
        for (int i = 1; i <= lg; i++) {
            pw[i] = pw[i - 1] * pw[i - 1];
        }

        auto work = [&]() {
            vector<int> stk;
            set<int> alive;
            for (int i = 0; i < n; i++) {
                alive.insert(i);
            }
            vector<vector<int>> at(n);
            for (int i = 0; i < m; i++) {
                at[qr[i]].push_back(i);
            }
            vector<vector<Hash>> f;
            int zero = 0;
            map<Hash, int> mp;
            for (int r = 0; r < n; r++) {
                if (int(a[r]) <= P / 2) {
                    stk.push_back(r);
                    f.emplace_back(lg);
                    int sz = f.size();
                    for (int i = 0; 1 << i <= sz; i++) {
                        f.back()[i] = i == 0 ? Hash(a[r]) : f[sz - 1 - (1 << i - 1)][i - 1] * pw[i - 1] + f.back()[i - 1];
                    }
                } else {
                    if (stk.empty() || a[stk.back()] + a[r] != 0) {
                        while (!alive.empty() && *alive.begin() <= r) {
                            alive.erase(alive.begin());
                        }
                        stk.clear();
                        f.clear();
                    } else {
                        int l = stk.back();
                        stk.pop_back();
                        f.pop_back();
                        auto it = alive.lower_bound(l + 1);
                        while (it != alive.end() && *it <= r) {
                            it = alive.erase(it);
                        }
                    }
                }
                for (auto qi : at[r]) {
                    int l = ql[qi];
                    if (alive.count(l)) {
                        int i = lower_bound(stk.begin(), stk.end(), l) - stk.begin();
                        int d = f.size() - i;
                        Hash res;
                        for (int b = lg; b >= 0; b--) {
                            if (d >> b & 1) {
                                i += 1 << b;
                                res = res * pw[b] + f[i - 1][b];
                            }
                        }
                        if (res == Hash(0)) {
                            zero++;
                        } else {
                            mp[res]++;
                        }
                    }
                }
            }
            return pair(zero, mp);
        };

        auto [zero, mp] = work();

        for (int i = 0; i < n; i++) {
            a[i] = -a[i];
        }
        reverse(a.begin(), a.end());
        for (int i = 0; i < m; i++) {
            tie(ql[i], qr[i]) = pair(n - qr[i] - 1, n - ql[i] - 1);
        }

        auto [zero2, mp2] = work();
        assert(zero == zero2);

        int ans = zero / 2;
        for (auto [p, c] : mp) {
            ans += min(c, mp2[p]);
        }

        cout << ans << '\n';
    };
    
    while (t--) {
        solve();
    }
    
    return 0;
}