#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64777216")
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double pi = acos(-1.0), eps = 1e-9;
const int INF = 1000 * 1000 * 1000;
int n, k;
string s;
void prepare(string s) {
  if ((int)s.size() != 0) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
void solve() {
  cin >> n >> k >> s;
  int pos = k;
  if (pos - 1 < (int)s.size() - pos) {
    while (pos > 1) {
      cout << "LEFT\n";
      pos--;
    }
    cout << "PRINT " << s[0] << '\n';
    for (int i = 1; i < (int)s.size(); i++) {
      cout << "RIGHT\n";
      cout << "PRINT " << s[i] << '\n';
    }
  } else {
    while (pos < (int)s.size()) {
      cout << "RIGHT\n";
      pos++;
    }
    cout << "PRINT " << s[(int)s.size() - 1] << '\n';
    for (int i = (int)s.size() - 2; i >= 0; i--) {
      cout << "LEFT\n";
      cout << "PRINT " << s[i] << '\n';
    }
  }
}
int main() {
  prepare("");
  solve();
  return 0;
}
