#include <bits/stdc++.h>
using namespace std;
priority_queue<int> q, p;
int a[100001], b[100001], l, r, n, i, j;
int main() {
  cin >> n >> l >> r;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    if (i <= r && l <= i) q.push(a[i]);
  }
  for (i = 1; i <= n; i++) {
    cin >> b[i];
    if (i <= r && i >= l) p.push(a[i]);
  }
  for (i = 1; i < l; i++)
    if (a[i] != b[i]) {
      cout << "LIE" << endl;
      return 0;
    }
  for (i = r + 1; i <= n; i++)
    if (a[i] != b[i]) {
      cout << "LIE" << endl;
      return 0;
    }
  while (!q.empty() && !p.empty()) {
    if (p.top() != q.top()) {
      cout << "LIE" << endl;
      return 0;
    }
    q.pop(), p.pop();
  }
  cout << "TRUTH" << endl;
  return 0;
}
