#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, mod = (int)1e9 + 7;
int a[N], b[N], cnt1[N], cnt2[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, l, r;
  cin >> n >> l >> r;
  for (int i = (1); i <= (int)(n); ++i) cin >> a[i];
  for (int i = (1); i <= (int)(n); ++i) cin >> b[i];
  for (int i = (1); i <= (int)(n); ++i) {
    if (i < l || i > r) {
      if (a[i] != b[i])
        return cout << "LIE"
                    << "\n",
               0;
      ;
    } else if (i <= r) {
      cnt1[a[i]]++;
      cnt2[b[i]]++;
    }
    if (i == r)
      for (int i = (l); i <= (int)(r); ++i)
        if (cnt1[a[i]] != cnt2[a[i]])
          return cout << "LIE"
                      << "\n",
                 0;
    ;
  }
  return cout << "TRUTH"
              << "\n",
         0;
  ;
  return 0;
}
