#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
char s[2005];
void fmain(int tid) {
  scanf("%d%d", &n, &k);
  scanf("%s", s + 1);
  int len = n - (k - 1) * 2;
  vector<pair<int, int> > ans;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    char tar = '.';
    if (i <= (k - 1) * 2) {
      if (i & 1)
        tar = '(';
      else
        tar = ')';
    } else {
      if (i - (k - 1) * 2 <= len / 2)
        tar = '(';
      else
        tar = ')';
    }
    if (s[i] == tar) continue;
    int j = i + 1;
    while (s[j] != tar) j++;
    ans.push_back({i, j});
    reverse(s + i, s + j + 1);
  }
  printf("%d\n", ans.size());
  for (auto p : ans) printf("%d %d\n", p.first, p.second);
}
int main() {
  int t = 1;
  scanf("%d", &t);
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
