#include <bits/stdc++.h>

using namespace std;

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

vector<int> nodes[100005];
int deg[50005];
queue<int> q;
int n,m;

void read()
{
    int x,y;
    fin>>n>>m;
    for(int i=0;i<m;i++)
    {
        fin>>x>>y;

        nodes[x].push_back(y);
        deg[y]++;
    }
}

void init()
{
    for(int i=1;i<=n;i++)
        if(deg[i]==0)
            q.push(i);
}

void bfs()
{
    while(!q.empty())
    {
        fout<<q.front()<<" ";
        for(auto it: nodes[q.front()])
        {
            deg[it]--;
            if(deg[it]==0)
                q.push(it);
        }
        q.pop();
    }
}

int main()
{
    read();
    init();
    bfs();
    return 0;
}