#include <cstdio>
#include <vector>
#include <queue>
#define maxn 50010

using namespace std;
vector<int>a[maxn];
vector<int> sol;
queue<int> q;
int n,m;
int grad[maxn];

void read()
{
    int x,y;
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        a[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;i++)
       if(grad[i]==0) q.push(i),sol.push_back(i);

}

void solve()
{
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
       for(int i=0;i<a[nod].size();i++)
       {
           int nodc=a[nod][i];
           grad[nodc]--;
           if(grad[nodc]==0) q.push(nodc),sol.push_back(nodc);
       }
    }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    read();
    solve();
    for(int i=0;i<sol.size();i++)
     printf("%d ",sol[i]);
    return 0;
}