#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
const long long mod = 1e9 + 7;
const long long inf = 1e9;
const double eps = 1e-16;
const double pi = acos(-1);
inline long long rd() {
  long long p = 0;
  long long f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f *= -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    p = p * 10 + ch - '0';
    ch = getchar();
  }
  return p * f;
}
long long n, k;
char a[N];
vector<long long> v[N];
signed main() {
  n = rd();
  k = rd();
  for (long long i = (1); i <= (n); i++) scanf("\n%c", &a[i]);
  long long ti = 0;
  while (1) {
    ti++;
    bool bk = 0;
    for (long long i = (1); i <= (n - 1); i++)
      if (a[i] == 'R' && a[i + 1] == 'L') {
        a[i] = 'L';
        a[i + 1] = 'R';
        v[ti].push_back(i);
        bk = 1;
        i++;
      }
    if (!bk) {
      ti--;
      break;
    }
  }
  if (ti > k) {
    puts("-1");
    return 0;
  } else {
    long long p = 0;
    long long s = 0;
    for (long long i = (ti); i >= (1); i--) {
      if (i - 1 + s + ((long long)(v[i].size())) >= k) {
        p = i;
        break;
      }
      s += ((long long)(v[i].size()));
    }
    if (p == 0) {
      puts("-1");
      return 0;
    }
    for (long long i = (1); i <= (p - 1); i++) {
      printf("%lld", ((long long)(v[i].size())));
      for (long long j = (0); j <= (((long long)(v[i].size())) - 1); j++)
        printf(" %lld", v[i][j]);
      puts("");
    }
    long long sz = k - s - (p - 1);
    if (sz == 1) {
      printf("%lld", ((long long)(v[p].size())));
      for (long long j = (0); j <= (((long long)(v[p].size())) - 1); j++)
        printf(" %lld", v[p][j]);
      puts("");
    } else {
      printf("%lld", ((long long)(v[p].size())) - (sz - 1));
      for (long long j = (0); j <= (((long long)(v[p].size())) - (sz - 1) - 1);
           j++)
        printf(" %lld", v[p][j]);
      puts("");
      for (long long j = (((long long)(v[p].size())) - (sz - 1));
           j <= (((long long)(v[p].size())) - 1); j++)
        printf("1 %lld\n", v[p][j]);
    }
    for (long long i = (p + 1); i <= (ti); i++) {
      for (long long j = (0); j <= (((long long)(v[i].size())) - 1); j++)
        printf("1 %lld\n", v[i][j]);
    }
  }
  return 0;
}
