#include <bits/stdc++.h>
using namespace std;
const long long int INF = 9223372036854775807LL;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroint-loops")
long long int power(long long int a, long long int b, long long int m) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = ((res % m) * (a % m)) % m;
    a = ((a % m) * (a % m)) % m;
    b >>= 1;
  }
  return res;
}
long long int power(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res *= a;
    a *= a;
    b >>= 1;
  }
  return res;
}
bool isPowerOfTwo(long long int x) { return (x && !(x & (x - 1))); }
void solve() {
  long long int n, l, r;
  cin >> n >> l >> r;
  vector<long long int> a(n + 1), b(n + 1);
  for (long long int i = 1; i <= n; i++) cin >> a[i];
  for (long long int i = 1; i <= n; i++) cin >> b[i];
  bool flag = false;
  for (long long int i = 1; i <= l - 1; i++)
    if (b[i] != a[i]) flag = true;
  for (long long int i = r + 1; i <= n; i++)
    if (b[i] != a[i]) flag = true;
  if (flag)
    cout << "LIE";
  else
    cout << "TRUTH";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int tt = 1;
  while (tt--) {
    solve();
  }
  return 0;
}
