Problem: Polycarp plays a computer game. In this game, the players summon armies of magical minions, which then fight each other.

Polycarp can summon n different minions. The initial power level of the i-th minion is a_i, and when it is summoned, all previously summoned minions' power levels are increased by b_i. The minions can be summoned in any order.

Unfortunately, Polycarp cannot have more than k minions under his control. To get rid of unwanted minions after summoning them, he may destroy them. Each minion can be summoned (and destroyed) only once.

Polycarp's goal is to summon the strongest possible army. Formally, he wants to maximize the sum of power levels of all minions under his control (those which are summoned and not destroyed).

Help Polycarp to make up a plan of actions to summon the strongest possible army!

Input

The first line contains one integer T (1 ≤ T ≤ 75) — the number of test cases.

Each test case begins with a line containing two integers n and k (1 ≤ k ≤ n ≤ 75) — the number of minions availible for summoning, and the maximum number of minions that can be controlled by Polycarp, respectively.

Then n lines follow, the i-th line contains 2 integers a_i and b_i (1 ≤ a_i ≤ 10^5, 0 ≤ b_i ≤ 10^5) — the parameters of the i-th minion.

Output

For each test case print the optimal sequence of actions as follows:

Firstly, print m — the number of actions which Polycarp has to perform (0 ≤ m ≤ 2n). Then print m integers o_1, o_2, ..., o_m, where o_i denotes the i-th action as follows: if the i-th action is to summon the minion x, then o_i = x, and if the i-th action is to destroy the minion x, then o_i = -x. Each minion can be summoned at most once and cannot be destroyed before being summoned (and, obviously, cannot be destroyed more than once). The number of minions in Polycarp's army should be not greater than k after every action.

If there are multiple optimal sequences, print any of them.

Example

Input


3
5 2
5 3
7 0
5 0
4 0
10 0
2 1
10 100
50 10
5 5
1 5
2 4
3 3
4 2
5 1


Output


4
2 1 -1 5
1
2
5
5 4 3 2 1

Note

Consider the example test.

In the first test case, Polycarp can summon the minion 2 with power level 7, then summon the minion 1, which will increase the power level of the previous minion by 3, then destroy the minion 1, and finally, summon the minion 5. After this, Polycarp will have two minions with power levels of 10.

In the second test case, Polycarp can control only one minion, so he should choose the strongest of them and summon it.

In the third test case, Polycarp is able to summon and control all five minions.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
void read(int &val) {
  int x = 0;
  int bz = 1;
  char c;
  for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar())
    ;
  if (c == '-') {
    bz = -1;
    c = getchar();
  }
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  val = x * bz;
}
const int maxn = 1e5 + 101;
const int mod = 1e9 + 7;
struct Edge {
  int from, to, cap, flow;
  long long cost;
};
int a[maxn], b[maxn];
bool cmp(int x, int y) { return b[x] < b[y]; }
int n, k;
int N;
struct MCMF {
  int n, m;
  vector<Edge> edge;
  vector<int> G[maxn];
  int inq[maxn], p[maxn], a[maxn], To[maxn];
  long long d[maxn];
  int tag[maxn];
  void init(int _n) {
    n = _n;
    for (int i = 0; i <= n; i++) G[i].clear();
    edge.clear();
  }
  void add(int from, int to, int cap, long long cost, int flag) {
    edge.push_back(Edge{from, to, cap, 0, cost});
    edge.push_back(Edge{to, from, 0, 0, -cost});
    m = edge.size();
    G[from].push_back(m - 2);
    G[to].push_back(m - 1);
    tag[m - 2] = tag[m - 1] = flag;
    To[m - 1] = To[m - 2] = to - N;
  }
  bool BellFord(int s, int t, int &flow, long long &cost) {
    for (int i = 0; i <= n; i++) d[i] = INF, inq[i] = 0;
    d[s] = 0;
    inq[s] = 1;
    p[s] = 0;
    a[s] = INF;
    queue<int> q;
    q.push(s);
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      inq[u] = 0;
      for (auto to : G[u]) {
        Edge &e = edge[to];
        if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {
          d[e.to] = d[u] + e.cost;
          p[e.to] = to;
          a[e.to] = min(a[u], e.cap - e.flow);
          if (!inq[e.to]) {
            q.push(e.to);
            inq[e.to] = 1;
          }
        }
      }
    }
    if (d[t] == INF) return false;
    flow += a[t];
    cost += 1LL * d[t] * a[t];
    for (int u = t; u != s; u = edge[p[u]].from) {
      edge[p[u]].flow += a[t];
      edge[p[u] ^ 1].flow -= a[t];
    }
    return true;
  }
  void MincostMaxflow(int s, int t, long long &cost) {
    int flow = 0;
    cost = 0;
    while (BellFord(s, t, flow, cost))
      ;
    vector<int> ans1, ans2;
    n = (n - 4) / 3;
    for (int i = 1; i <= n; i++) {
      for (auto to : G[i]) {
        if (edge[to].flow == false) continue;
        if (tag[to] == 1) {
          ans1.push_back(To[to]);
        } else if (tag[to] == 2) {
          ans2.push_back(To[to]);
        }
      }
    }
    sort(ans1.begin(), ans1.end(), cmp);
    int sz = ans1.size();
    for (int i = 0; i <= sz - 2; i++) {
      printf("%d ", ans1[i]);
    }
    for (auto to : ans2) {
      printf("%d %d ", to, -to);
    }
    printf("%d\n", ans1[sz - 1]);
  }
} M;
int main() {
  int t;
  read(t);
  while (t--) {
    read(n);
    read(k);
    N = n;
    M.init(3 * n + 4);
    int mx = 0, j = 0;
    for (int i = 1; i <= n; i++) {
      read(a[i]);
      read(b[i]);
      if (mx < a[i]) j = i;
      mx = max(mx, a[i]);
    }
    if (k == 1) {
      printf("%d\n%d\n", 1, j);
      continue;
    }
    printf("%d\n", k + 2 * (n - k));
    int s = 0, t = 3 * n + 3;
    for (int i = 1; i <= n; i++) {
      M.add(s, i, 1, 0, -1);
    }
    for (int i = 1; i <= k - 1; i++) {
      for (int j = 1; j <= n; j++) {
        M.add(i, j + n, 1, -(1LL * (i - 1) * b[j] + a[j]), 1);
      }
    }
    for (int i = k; i <= n - 1; i++) {
      for (int j = 1; j <= n; j++) {
        M.add(i, j + n, 1, -(1LL * (k - 1) * b[j]), 2);
      }
    }
    for (int j = 1; j <= n; j++) {
      M.add(n, j + n, 1, -(1LL * (k - 1) * b[j] + a[j]), 1);
    }
    for (int i = n + 1; i <= n + n; i++) {
      M.add(i, t, 1, 0, -1);
    }
    long long cost = 0;
    M.MincostMaxflow(s, t, cost);
  }
  return 0;
}