#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
queue <int >q;
int n,m,i,j,x,y,gr[50001],ok,k;
vector <int > v[50001];
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].pb(y);
ok=1;
for(k=0;k<v[x].size()&&ok;k++)
    if(v[x][k]==y)
        ok=0;
   if(ok)
        gr[y]++;

    }

    for(i=1;i<=n;i++)
    {
        if(!gr[i])
            q.push(i);
    }

    while(!q.empty())
    {
        x=q.front();
        q.pop();
        g<<x<<" ";
        for(j=0;j<v[x].size();j++)
        {
            y=v[x][j];
            gr[y]--;
            if(!gr[y])
                q.push(y);
        }
    }

    return 0;

}