#include <bits/stdc++.h>
using namespace std;
const double pi = (2 * acos(0));
struct point {
  long double x, y;
};
double area(int x1, int y1, int x2, int y2, int x3, int y3) {
  double a =
      (x2 * y3) - (x3 * y2) - (x1 * y3) + (x3 * y1) + (x1 * y2) - (x2 * y1);
  a /= 2;
  return fabs(a);
}
long double anyarea(point p[], int n) {
  long double sum1 = p[n - 1].x * p[0].y, sum2 = p[n - 1].y * p[0].x;
  for (int i = 0; i < n - 1; i++) {
    sum1 += p[i].x * p[i + 1].y;
    sum2 += p[i].y * p[i + 1].x;
  }
  return fabs((sum1 - sum2) * 0.5);
}
long long fastpow(long long base, long long p, long long m) {
  if (p == 0) return 1;
  long long ans = fastpow(base, p / 2, m);
  ans = ((ans % m) * (ans % m)) % m;
  if (p % 2) ans = ((base % m) * ans) % m;
  return ans;
}
long long GCD(long long M, long long m) {
  if (M % m == 0) return m;
  M %= m;
  long long x1 = M, x2 = m;
  m = min(x1, x2);
  M = max(x1, x2);
  return GCD(M, m);
}
long long lcm(long long M, long long m) {
  return (M * m) / GCD(max(M, m), min(M, m));
}
int main() {
  int n, l, r;
  cin >> n >> l >> r;
  int arr[100005];
  bool t = true;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (i < l - 1) {
      if (arr[i] != x) t = false;
    }
    if (i > r - 1) {
      if (arr[i] != x) t = false;
    }
  }
  if (t)
    cout << "TRUTH";
  else
    cout << "LIE";
}
