#include <bits/stdc++.h>

#define Nmax 50005

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

int n,m;
int grad[Nmax];

vector <int> v[Nmax];

queue <int> q;

void cit()
{
    in>>n>>m;
    while(m--)
    {
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
}

void prg()
{
    for(int i=1;i<=n;i++)
        if(!grad[i])
            q.push(i);
    while(!q.empty())
    {
        int curent=q.front();
        out<<curent<<' ';
        q.pop();
        for(size_t i=0;i<v[curent].size();i++)
        {
            grad[v[curent][i]]--;
            if(grad[v[curent][i]]==0)
                q.push(v[curent][i]);
        }
    }
}

int main()
{
    cit();
    prg();
    return 0;
}