/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define	endl		'\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x) 	for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define max(a,b)	(a>b?a:b)
#define min(a,b)	(a<b?a:b)

/*	For Debugging	*/
#define DEBUG 		cerr<<"\n>>>I'm Here<<<\n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_is(x)  cerr << #x << " is " << x << endl;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  100005
vi v(N);
vi a[3000005];
ll n;

void call(ll& tmpk)
{
	ll j;
	// rep(i,0,n)
	// cout<<v[i]<<" ";
	// cout<<endl;
	rep(i,1,n)
	{
		j=i;
		while(v[j]==0 && v[j-1]==1)
		{
			a[tmpk].pb(j-1);
			swap(v[j],v[j-1]);
			tmpk++;
			j--;
		}
	}
}

void solve()
{
	ll k;
	cin>>n>>k;
	string s;
	cin>>s;
	ll cnt=0,sum=0;
	rep(i,0,n)
	{
		v[i]=(s[i]=='L'?0:1);
		if(v[i])
			cnt++;
		else
			sum+=cnt;
	}
	// what_is(sum);
	if(sum<k)
	{
		cout<<-1<<endl;
		return;
	}
	ll tmpk=0;
	ll tt=0;
	vi tmp;
	while(sum>0)
	{
		tmp.clear();
		rep(i,1,n)
		{
			if(v[i-1] && !v[i])
				tmp.pb(i-1);
		}
		if(sum-sz(tmp)>=k-tmpk-1)
		{
			sum-=sz(tmp);
			trav(i,tmp)
			swap(v[i],v[i+1]);
			a[tmpk]=tmp;
			tmpk++;
		}
		else
		{
			ll j=0;
			// trav(lll,tmp)
			// cerr<<lll<<" ";
			// cerr<<endl;
			while(sum>k-tmpk-1)
			{
				swap(v[tmp[j]],v[tmp[j]+1]);
				a[tmpk].pb(tmp[j]);
				j++;
				sum--;
			}
			tmpk++;
			call(tmpk);
			break;
		}
		if(k-tmpk<=0 && sum>0)
		{
			cout<<-1<<endl;
			return;
		}
	}
	if(tmpk<k)
		call(tmpk);
	rep(i,0,k)
	{
		cout<<sz(a[i])<<" ";
		trav(j,a[i])
		cout<<j+1<<" ";
		cout<<endl;
	}
	return;
}
int main()
{
	FAST
	#ifndef ONLINE_JUDGE
	// freopen ("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);
	#endif
	int TESTS=1;
//	cin>>TESTS;
	while(TESTS--)
	{
		solve();
	}
	TIME
	return 0;
}