#include <bits/stdc++.h>
const long double PI = 3.141592653589793238462643383279;
const long double EPS = 1e-8;
const int NONE = 1e9 + 7;
const long long MOD = 1e9;
const int base = 1000 * 1000 * 1000;
const int LOG = 20;
const long long HASH_MODS[] = {1000000007333ll, 1000000009367ll,
                               1000000075747ll, 1000000158923ll,
                               1000000203119ll};
int a[200001];
int b[200001];
int cnt1[200001];
int cnt2[200001];
int main() {
  int n;
  scanf("%d", &n);
  int l, r;
  scanf("%d%d", &l, &r);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 1; i <= n; ++i) scanf("%d", &b[i]);
  for (int i = l; i <= r; ++i) cnt1[a[i]]++;
  for (int i = l; i <= r; ++i) cnt2[b[i]]++;
  for (int i = 1; i <= n; ++i)
    if (cnt1[i] != cnt2[i]) {
      printf("LIE");
      return 0;
    }
  for (int i = 1; i < l; ++i)
    if (a[i] != b[i]) {
      printf("LIE");
      return 0;
    }
  for (int i = r + 1; i <= n; ++i)
    if (a[i] != b[i]) {
      printf("LIE");
      return 0;
    }
  printf("TRUTH");
}
