#include <bits/stdc++.h>

using namespace std;

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

const int N = 50001;
vector<int> v[N];
int gr[N], n, m, x, y;
queue<int> q;

int main()
{
    fin>>n>>m;

    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
        gr[y]++;
    }

    for(int i=1; i<=n; i++)
        if(gr[i] == 0)
            q.push(i);

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        fout<<nod<<" ";

        for(auto vec:v[nod])
        {
            gr[vec]--;
            if(gr[vec] == 0)
                q.push(vec);
        }
    }

    return 0;
}