#include<fstream>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50100];
int n, m, i, j, a, b, gr[50100];
queue <int> q;

int main(){
    fin >> n >> m;
    for (i = 1; i <= m; i++){
        fin >> a >> b;
        v[a].push_back(b); gr[b]++;
    }
    for (i = 1; i <= n; i++)
        if (gr[i] == 0)
            q.push(i);//q[++q[0]] = i;
    for (i = 1; i <= n; i++){
        int nod = q.front(); q.pop(); fout << nod << " ";//q[i];
        for (j = 0; j < v[nod].size(); j++){
            gr[v[nod][j]]--;
            if (gr[v[nod][j]] == 0)
                q.push(v[nod][j]);//q[++q[0]] = v[nod][j];
        }
    }

    //for (i = 1; i <= n; i++)
    //    fout << q[i] << " ";
    fout << '\n';
    fin.close();
    fout.close();
}