#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
char ar[1001];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c, d, e, f = 0, g, h = 0, x, y, z;
  cin >> a >> b;
  cin >> ar;
  b--;
  c = (a - 1) / 2;
  if (b <= c) {
    while (b > 0) {
      cout << "LEFT" << endl;
      b--;
    }
  } else {
    while (b < a - 1) {
      cout << "RIGHT" << endl;
      b++;
    }
  }
  if (b == 0) {
    for (int i = 0; i < a; i++) {
      cout << "PRINT " << ar[i] << endl;
      if (i < a - 1) cout << "RIGHT" << endl;
    }
  } else {
    for (int i = a - 1; i >= 0; i--) {
      cout << "PRINT " << ar[i] << endl;
      if (i > 0) cout << "LEFT" << endl;
    }
  }
}
