#include <bits/stdc++.h>
#pragma GCC optimize "trapv"
using namespace std;
const int INF = 1e9;
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
void solve() {
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  vector<pair<int, int>> ans;
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0 && s[i] == ')') {
      for (int j = i + 1; j < n; j++) {
        if (s[j] == '(') {
          ans.push_back({i + 1, j + 1});
          string t = s.substr(i, j - i + 1);
          reverse(t.begin(), t.end());
          s.replace(i, j - i + 1, t);
          break;
        }
      }
    } else if (i % 2 == 1 && s[i] == '(') {
      for (int j = i + 1; j < n; j++) {
        if (s[j] == ')') {
          ans.push_back({i + 1, j + 1});
          string t = s.substr(i, j - i + 1);
          reverse(t.begin(), t.end());
          s.replace(i, j - i + 1, t);
          break;
        }
      }
    }
  }
  int count = n / 2;
  vector<int> val(n + 1, 0);
  for (int i = 0; i < n; i++) {
    val[i + 1] = val[i] + (s[i] == '(' ? 1 : -1);
  };
  if (count > k) {
    count -= k;
    for (int i = 1; i <= n && count; i++) {
      if (val[i] == 0) {
        ans.push_back({i, i + 1});
        i++;
        count--;
      }
    }
  }
  cout << ans.size() << endl;
  for (auto x : ans) {
    cout << x.first << " " << x.second << endl;
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) solve();
}
