#include <bits/stdc++.h>
const int N = 1e7 + 5, M = 1e5, OO = 0x3f3f3f3f, mod = 1e9 + 7;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
const double PI = acos(-1.0);
using namespace std;
long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return ((x / gcd(x, y)) * y); }
void file() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  file();
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  if (k <= n / 2) {
    for (int i = k; i > 1; i--) cout << "LEFT\n";
    for (int i = 0; i < n; i++) {
      cout << "PRINT " << s[i] << '\n';
      if (i != n - 1) cout << "RIGHT\n";
    }
  } else {
    for (int i = k; i < n; i++) cout << "RIGHT\n";
    for (int i = n - 1; i > -1; i--) {
      cout << "PRINT " << s[i] << '\n';
      if (i != 0) cout << "LEFT\n";
    }
  }
}
