#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
std::vector<std::vector<long long>> v;
std::vector<bool> visit;
long long count1;
struct node {
  long long a, b, c, d;
  bool flag;
};
long long mul(long long x, long long y) { return x * y % MOD; }
long long power(long long x, long long y) {
  long long ans = 1;
  while (y) {
    if (y & 1) ans = mul(ans, x);
    x = mul(x, x);
    y >>= 1;
  }
  return ans;
}
long long inverse(long long n) { return power(n, MOD - 2); }
long long divi(long long x, long long y) { return mul(x, inverse(y)); }
bool com(long long a, long long b) { return (a - b); }
void dfs(long long s) {
  count1++;
  visit[s] = true;
  for (long long i = 0; i < v[s].size(); i++) {
    if (visit[v[s][i]] == false) {
      dfs(v[s][i]);
    }
  }
}
int solve() {
  long long n, l, r;
  cin >> n >> l >> r;
  std::vector<long long> a(n);
  std::vector<long long> b(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (long long i = 0; i < n; i++) {
    cin >> b[i];
  }
  sort(b.begin() + l - 1, b.begin() + r);
  sort(a.begin() + l - 1, a.begin() + r);
  for (long long i = 0; i < n; i++) {
    if (a[i] != b[i]) {
      cout << "LIE" << endl;
      return 0;
    }
  }
  cout << "TRUTH" << endl;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
