#include <bits/stdc++.h>
using namespace std;
int gcdExtended(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long int modInverse(int a, int m) {
  int x, y;
  int g = gcdExtended(a, m, &x, &y);
  long long int res = ((long long int)x % m + (long long int)m) % m;
  return res;
}
long long int poww(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return poww(x * x, n / 2);
  else
    return x * poww(x * x, (n - 1) / 2);
}
long long int modularExponentiation(long long int x, long long int n,
                                    long long int M) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
inline long long int max(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
inline long long int min(long long int a, long long int b) {
  if (a > b)
    return b;
  else
    return a;
}
int gcd(int a, int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a == b) return a;
  if (a > b)
    return gcd(a - b, b);
  else
    return gcd(a, b - a);
}
long long int ncr(int n, int r) {
  long long int ans = 1;
  r = min(r, n - r);
  for (int i = 0; i < r; i++) {
    ans = (ans * (n - i) / (i + 1)) % 1000000007;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    long long int n, k, l, r;
    cin >> n >> l >> r;
    l--;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    ;
    for (int i = 0; i < n; i++) cin >> b[i];
    ;
    map<int, int> m;
    for (int i = 0; i < l; i++) {
      if (a[i] != b[i]) {
        cout << "LIE";
        return 0;
      }
    }
    for (int i = l; i < r; i++) {
      m[a[i]]++;
      m[b[i]]--;
    }
    for (auto x : m) {
      if (x.second != 0) {
        cout << "LIE";
        return 0;
      }
    }
    m.clear();
    for (int i = r; i < n; i++) {
      if (a[i] != b[i]) {
        cout << "LIE";
        return 0;
      }
    }
    cout << "TRUTH";
  }
  return 0;
}
