#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
inline int FIX(long long a) { return (a % Mod + Mod) % Mod; }
int n, k;
int main() {
  scanf("%d %d", &n, &k);
  string s;
  cin >> s;
  if (k <= n / 2) {
    for (int i = 1; i < k; i++) {
      printf("LEFT\n");
    }
    for (int i = 0; i < s.length(); i++) {
      printf("PRINT %c\n", s[i]);
      if (i < s.length() - 1) printf("RIGHT\n");
    }
  } else {
    for (int i = 1; i <= n - k; i++) {
      printf("RIGHT\n");
    }
    for (int i = (int)s.length() - 1; i >= 0; i--) {
      printf("PRINT %c\n", s[i]);
      if (i > 0) printf("LEFT\n");
    }
  }
  return 0;
}
