#include <bits/stdc++.h>

using namespace std;

int n, m, p, post[50005];
vector<int> v[50005];
bool ok[50005];

void df(int x)
{
    ok[x] = 1;
    for (vector<int>::iterator it = v[x].begin(); it != v[x].end(); ++it)
        if(!ok[*it]){
            ok[*it] = 1;
            df(*it);
        }
    post[++p] = x;
}

int main()
{
    ifstream fin ("sortaret.in");
    ofstream fout ("sortaret.out");
    fin >> n >> m;
    while(m--){
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    df(1);
    for (int i = p; i >= 1; --i)
        fout << post[i] << " ";
    return 0;
}