#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

#define NMAX 50005

int N,M;
int Grade[NMAX],TSL[NMAX];

vector < int > G[NMAX];
queue < int > NIE;

void Read()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d%d",&N,&M);

    int x,y;
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
        Grade[y]++;
    }
}

void Solve()
{
    for(int i=1;i<=N;i++)
        if(!Grade[i])
            NIE.push(i);

    vector < int > :: iterator it;

    while(!NIE.empty())
    {
        int nod = NIE.front();
        NIE.pop();
        TSL[++TSL[0]] = nod;

        for(it=G[nod].begin();it!=G[nod].end();++it)
        {
            Grade[*it]--;
            if(Grade[*it]==0)
                NIE.push(*it);
        }
    }
}

void Print()
{
    freopen("sortaret.out","w",stdout);

    for(int i=1;i<=N;i++)
        printf("%d ",TSL[i]);
}

int main()
{
    Read();
    Solve();
    Print();

    return 0;
}