#include <iostream>

using namespace std;

const int kNsize = 100010;
const int kMsize = 100010;

int m, n;
unsigned long long a[kMsize], b[kNsize];
unsigned long long a_sum, b_sum;

int main()
{
    cin>>m>>n;
    for (int i = 1; i <= m; i++) {
        cin>>a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin>>b[i];
    }
    a_sum = 0;
    b_sum = 0;
    for (int i = 1; i <= m; i++) {
        a_sum += 1;
        a_sum += a[i];
    }
    for (int i = 1; i <= n; i++) {
        b_sum += 1;
        b_sum += b[i];
    }

    if (a_sum == b_sum) {
        cout<<"TIED"<<endl;
    } else if (a_sum > b_sum) {
        cout<<"ALICE"<<endl;
    } else {
        cout<<"BOB"<<endl;
    }

    return 0;
}