#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
struct Edge {
  int to, val, next, cost;
} edge[25086];
int s, t;
int cnt = -1;
int head[25086];
queue<int> q;
int d[25086];
int cur[25086];
int inq[25086];
int vis[25086];
int costsum;
void addEdge(int u, int v, int w, int f) {
  cnt++;
  edge[cnt].to = v;
  edge[cnt].val = w;
  edge[cnt].next = head[u];
  edge[cnt].cost = f;
  head[u] = cnt;
  cnt++;
  edge[cnt].to = u;
  edge[cnt].val = 0;
  edge[cnt].next = head[v];
  edge[cnt].cost = -f;
  head[v] = cnt;
}
bool bfs() {
  memset(d, 0x3f, sizeof(d));
  memset(vis, 0, sizeof(vis));
  d[s] = 0;
  q.push(s);
  inq[s] = 1;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    inq[u] = 0;
    for (int i = head[u]; i != -1; i = edge[i].next) {
      int v = edge[i].to;
      cur[v] = head[v];
      int f = edge[i].cost;
      if (d[v] > d[u] + f && edge[i].val > 0) {
        d[v] = d[u] + f;
        if (!inq[v]) {
          q.push(v);
          inq[v] = 1;
        }
      }
    }
  }
  return d[t] != inf;
}
int dfs(int u, int flow) {
  vis[u] = 1;
  int nowflow = 0;
  if (u == t) return flow;
  for (int i = cur[u]; i != -1; i = edge[i].next) {
    cur[u] = i;
    int v = edge[i].to;
    int w = edge[i].val;
    int f = edge[i].cost;
    if (d[v] == d[u] + f && w > 0 && !vis[v]) {
      int k = dfs(v, min(flow - nowflow, w));
      if (k > 0) {
        edge[i].val -= k;
        edge[i ^ 1].val += k;
        nowflow += k;
        costsum += f * k;
        if (nowflow == flow) break;
      }
    }
  }
  vis[u] = 0;
  if (!nowflow) d[u] = inf;
  return nowflow;
}
int dinic() {
  int ans = 0;
  while (bfs()) {
    ans += dfs(s, inf);
  }
  return ans;
}
int T;
int n, k, a, b;
int opt[25086];
int main() {
  scanf("%d", &T);
  while (T--) {
    memset(head, -1, sizeof(head));
    scanf("%d%d", &n, &k);
    s = 0, t = 2 * n + 1, costsum = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d%d", &a, &b);
      addEdge(s, i, 1, 0), addEdge(i + n, t, 1, 0);
      for (int j = 1; j <= n; j++) {
        if (j < k)
          addEdge(i, j + n, 1, a + (i - 1) + b);
        else if (j < n)
          addEdge(i, j + n, 1, (k - 1) * b);
        else
          addEdge(i, j + n, 1, a + (k - 1) + b);
      }
    }
    dinic();
    for (int i = 1; i <= n; i++) {
      for (int j = head[i]; j != 1; j = edge[j].next) {
        if (!edge[j].val) {
          opt[edge[j].to - n] = i;
          break;
        }
      }
    }
    printf("%d\n", k - 1 + (n - k) * 2 + 1);
    for (int i = 1; i <= n; i++) {
      if (i < k || i == n)
        printf("%d ", opt[i]);
      else
        printf("%d %d ", opt[i], -opt[i]);
    }
    puts("");
  }
}
