#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int vis[maxn];
int a[maxn];
int b[maxn];
int main() {
  int n, l, r;
  while (~scanf("%d%d%d", &n, &l, &r)) {
    memset(vis, 0, sizeof(vis));
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      vis[a[i]]++;
    }
    bool flag = 1;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &b[i]);
      vis[b[i]]++;
    }
    for (int i = 1; i <= n; i++)
      if (vis[a[i]] % 2) {
        flag = 0;
        break;
      }
    if (!flag) {
      puts("LIE");
      continue;
    }
    for (int i = 1; i <= n; i++)
      if ((i < l || i > r) && a[i] != b[i]) {
        flag = 0;
        break;
      }
    if (!flag)
      printf("LIE\n");
    else
      printf("TRUTH\n");
  }
  return 0;
}
