#include <fstream>
#include <vector>

using namespace std;

int n, m, r[50005], p = 0;
bool ok[50005];
vector<int> v[50005];

void dfs(int x)
{
    ok[x] = 1;
    r[++p] = x;
    for (int i = 0; i < v[x].size(); ++i)
        if(!ok[v[x][i]])
            dfs(v[x][i]);
}

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);
    }
    for (int i = 1; i <= n; ++i)
        if(!ok[i])
            dfs(i);
    for (int i = 1; i <= p; ++i)
        fout << r[i] << " ";
    fin.close();
    fout.close();
    return 0;
}