#include <bits/stdc++.h>
using namespace std;
const int oo = (int)1e9;
const int mod = (int)1e9 + 7;
const double PI = acos(-1.0);
const int MAX = 100008;
int n, l, r;
int a[MAX], b[MAX];
int main() {
  cin >> n >> l >> r;
  --l;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> b[i];
  sort(a + l, a + r);
  sort(b + l, b + r);
  for (int i = 0; i < n; i++) {
    if (a[i] != b[i]) {
      cout << "LIE" << endl;
      return 0;
    }
  }
  cout << "TRUTH" << endl;
  return 0;
}
