#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
vector <int> G[50005];
vector <int> sol;
queue  <int> q;
int de[50005],n,m;
int main()
{
    freopen("sortaret.in","r", stdin);
    freopen("sortaret.out", "w", stdout);

    int u,v;

    scanf("%d%d",&n, &m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d", &u, &v);
        G[u].push_back(v);
        de[v]++;
    }


    for(int i=1; i<=n; i++)
        if(!de[i])
           {
               q.push(i);
               sol.push_back(i);
           }
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(int i=0; i<(int) G[u].size(); i++)
        {
            v=G[u][i];
            de[v]--;
            if(!de[v])
               {
                   q.push(v);
                   sol.push_back(v);
               }
        }
    }

    for(int i=0; i<(int) sol.size(); i++)
        printf("%d ", sol[i]);
    return 0;
}