#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N=100001;
int n,m,nrp[N];
vector <int> a[N];
queue <int> q;
void citire()
{
    int i,x,y;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        a[x].push_back(y);
        nrp[y]++;
    }
}
void bfs()
{
    int x,y;
    for (int i = 1; i <= n; i++)
    {
        if (nrp[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {

        x=q.front();
        g<<x<<" ";
        q.pop();
        for(int i=0; i<a[x].size(); i++)
        {
            y=a[x][i];
            nrp[y]--;
            if(nrp[y]==0)
            {
                q.push(y);
            }
        }
    }
}
int main()
{
    citire();
    bfs();
    return 0;
}