#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int n,m,x,y;
vector<int>g[50005];
queue<int>q;
bool ver[50005];
int degin[50005];
int main()
{
    cin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        cin>>x>>y;
        g[x].push_back(y);
        degin[y]++;
    }
    for (int i=1; i<=n; i++)
        if (degin[i]==0)
        {
            q.push(i);
            ver[i]=1;
        }
    while (!q.empty())
    {
        int nod=q.front();
        cout<<nod<<' ';
        q.pop();
        for (int i=0;i<g[nod].size();i++)
        {
            degin[g[nod][i]]--;
            if (degin[g[nod][i]]==0)
                q.push(g[nod][i]);
        }
    }
    return 0;
}