#include <iostream>
#include <queue>

using namespace std;

bool solve()
{
    int n,l,a,b;
    long long sum1 = 0;
    long long sum2 = 0;
    priority_queue<int> actual;
    priority_queue<int> wanted;
    cin >> n;
    while(n--)
    {
        cin >> l >> a >> b;
        while(l--)
        {
            actual.push(a);
            wanted.push(b);
            sum1+=a;
            sum2+=b;
        }
    }
    if(sum1 != sum2)
    {
        return false;
    }
    while(!wanted.empty())
    {
        int a = actual.top(); actual.pop();
        int w = wanted.top(); wanted.pop();
        cout <<a<<" | "<<w<<endl;
        if(w > a)
        {
            return false;
        }
        else if(a > w)
        {
            wanted.push((2*w) - a);
            actual.push(w);
        }
    }
    return true;
}

int main()
{
    int z;
    cin >>z;
    while(z--)
    {
        cout << ((solve()) ? "TAK" : "NIE") <<endl;
    }
}