#include <bits/stdc++.h>
int cmp(const void* a, const void* b) { return (*(int*)a - *(int*)b); }
int main() {
  int n, l, r;
  scanf("%d%d%d", &n, &l, &r);
  int* a = (int*)malloc(n * sizeof(int));
  int* b = (int*)malloc(n * sizeof(int));
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  qsort(a + l - 1, r - l + 1, sizeof(int), cmp);
  qsort(b + l - 1, r - l + 1, sizeof(int), cmp);
  for (int i = 0; i < n; i++)
    if (a[i] != b[i]) {
      printf("%s", "LIE");
      return 0;
    }
  printf("%s", "TRUTH");
  return 0;
}
