#include <cstring>

#include<queue>

#include <cstdio>

using namespace std;

vector<int>to[+];

int n,m,cnt;

int outdeed[+],topo [+];

void init(){

    memset(outdeed,,sizeof(outdeed));

    for(int i=;i<=n;i++)

        to[i].clear();

    memset(topo,,sizeof(topo));

}

void toposort()

{

    priority_queue<int>q;

    for(int i=;i<=n;i++)

        if(!outdeed[i])q.push(i);

    cnt=;

    while(!q.empty())

    {

        int tmp = q.top();

        q.pop();

        topo[++cnt]=tmp;

        int k = to[tmp].size();

        for(int i=;i<k;i++)

        {

            int tt = to[tmp][i];

            outdeed[tt]--;

            if(outdeed[tt]==)q.push(tt);

        }

    }

}

void output()

{

    for(int i=n;i>=;i--)

        printf("%d%c",topo[i],i==?'\n':' ');

}

int main(){

    int T;

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d%d",&n,&m);

        init();

        for(int i=;i<=m;i++)

        {

            int u,v;

            scanf("%d%d",&u,&v);

            to[v].push_back(u);

            outdeed[u]++;

        }

        toposort();

        output();

    }

    return ;

}