Problem: There are n children, who study at the school №41. It is well-known that they are good mathematicians. Once at a break, they arranged a challenge for themselves. All children arranged in a row and turned heads either to the left or to the right.

Children can do the following: in one second several pairs of neighboring children who are looking at each other can simultaneously turn the head in the opposite direction. For instance, the one who was looking at the right neighbor turns left and vice versa for the second child. Moreover, every second at least one pair of neighboring children performs such action. They are going to finish when there is no pair of neighboring children who are looking at each other. 

You are given the number n, the initial arrangement of children and the number k. You have to find a way for the children to act if they want to finish the process in exactly k seconds. More formally, for each of the k moves, you need to output the numbers of the children who turn left during this move.

For instance, for the configuration shown below and k = 2 children can do the following steps: 

<image> At the beginning, two pairs make move: (1, 2) and (3, 4). After that, we receive the following configuration:  <image> At the second move pair (2, 3) makes the move. The final configuration is reached. Good job.  <image>

It is guaranteed that if the solution exists, it takes not more than n^2 "headturns".

Input

The first line of input contains two integers n and k (2 ≤ n ≤ 3000, 1 ≤ k ≤ 3000000) — the number of children and required number of moves.

The next line contains a string of length n and consists only of characters L and R, where L means that the child looks to the left and R means that the child looks to the right. 

Output

If there is no solution, print a single line with number -1.

Otherwise, output k lines. Each line has to start with a number n_i (1≤ n_i ≤ n/2) — the number of pairs of children, who turn at this move. After that print n_i distinct integers — the numbers of the children who will turn left during this move. 

After performing all "headturns", there can't be a pair of two neighboring children looking at each other.

If there are many solutions, print any of them.

Examples

Input


2 1
RL


Output


1 1 


Input


2 1
LR


Output


-1

Input


4 2
RLRL


Output


2 1 3 
1 2

Note

The first sample contains a pair of children who look at each other. After one move, they can finish the process.

In the second sample, children can't make any move. As a result, they can't end in k>0 moves.

The third configuration is described in the statement.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
std::mt19937 rnd(
    (int)std::chrono::steady_clock::now().time_since_epoch().count());
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 3000;
const int MAXWANT = 3000000;
int n, want;
char s[MAXN + 1];
vector<int> ans[MAXWANT];
int l[MAXN], nl;
int at[MAXN];
bool solve() {
  nl = 0;
  for (int i = (0); i < (n); ++i)
    if (s[i] == 'L') l[nl++] = i;
  for (int i = (0); i < (nl); ++i) at[i] = i;
  int lo = 0, hi = 0;
  for (int i = (0); i < (nl); ++i)
    lo = max(lo, (l[i] == at[i] ? 0 : nl - i - 1) + (l[i] - at[i])),
    hi += l[i] - at[i];
  if (want < lo || want > hi) return false;
  int rem = want;
  for (int i = (0); i < (want); ++i) ans[i].clear();
  for (int i = nl - 1; i >= 0; --i) {
    int nlo = 0;
    for (int j = (0); j < (i); ++j)
      nlo = max(nlo, (l[j] == at[j] ? 0 : i - j - 1) + (l[j] - at[j]));
    while (rem > nlo) {
      for (int j = (i); j < (nl); ++j)
        if (at[j] < l[j]) ans[want - rem].push_back(at[j]++);
      if (((int)(ans[want - rem]).size()) == 0) break;
      --rem;
    }
  }
  for (int x = 0, y = want - 1; x < y; ++x, --y) swap(ans[x], ans[y]);
  return true;
}
void run() {
  scanf("%d%d", &n, &want);
  scanf("%s", s);
  if (!solve()) {
    printf("-1\n");
    return;
  }
  for (int i = (0); i < (want); ++i) {
    printf("%d", ((int)(ans[i]).size()));
    for (int j = (0); j < (((int)(ans[i]).size())); ++j)
      printf(" %d", ans[i][j] + 1);
    puts("");
  }
}
char t[MAXN + 1];
void verify() {
  for (int i = (0); i <= (n); ++i) t[i] = s[i];
  for (int i = (0); i < (want); ++i) {
    assert(((int)(ans[i]).size()) >= 1);
    for (int j = (1); j < (((int)(ans[i]).size())); ++j)
      assert(ans[i][j] >= ans[i][j - 1] + 2);
    for (int j = (0); j < (((int)(ans[i]).size())); ++j)
      assert(t[ans[i][j]] == 'R' && t[ans[i][j] + 1] == 'L');
    for (int j = (0); j < (((int)(ans[i]).size())); ++j)
      swap(t[ans[i][j]], t[ans[i][j] + 1]);
  }
  for (int i = (0); i < (n - 1); ++i) assert(!(t[i] == 'R' && t[i + 1] == 'L'));
}
void stress() {
  for (int rep = (0); rep < (100000); ++rep) {
    n = rnd() % 20 + 10;
    want = rnd() % (n * n + 1);
    for (int i = (0); i < (n); ++i) s[i] = rnd() % 2 == 0 ? 'L' : 'R';
    s[n] = '\0';
    if (!solve()) continue;
    printf(".");
    verify();
  }
}
int main() {
  run();
  return 0;
}