#include <bits/stdc++.h>
using namespace std;
void problemA() {
  int n, k;
  string s;
  cin >> n >> k >> s;
  int mid = (n) / 2;
  if (k <= mid) {
    while (k > 1) {
      cout << "LEFT" << endl;
      k--;
    }
    for (int i = 1; i < n; i++) {
      cout << "PRINT " << s[i - 1] << endl;
      cout << "RIGHT" << endl;
    }
    cout << "PRINT " << s[n - 1] << endl;
  } else {
    while (k < n) {
      cout << "RIGHT" << endl;
      k++;
    }
    for (int i = n - 1; i > 0; i--) {
      cout << "PRINT " << s[i] << endl;
      cout << "LEFT" << endl;
    }
    cout << "PRINT " << s[0] << endl;
  }
}
void problemB() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n, 0);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  cout << a[n - k];
}
int main() {
  problemA();
  return 0;
}
