#include <fstream>
#include <vector>
#define maxn 50100

using namespace std;

vector<int> g[maxn];
vector<int> sol;
bool seen[maxn];
ifstream in("sortaret.in");
ofstream out("sortaret.out");

void dfs(int n) {
    seen[n] = true;
    for(int i = 0; i < g[n].size(); i++)
        if(!seen[g[n][i]])
            dfs(g[n][i]);

    sol.push_back(n);
}

int main(){
    int n, m, x, y;

    in>>n>>m;
    for(int i = 0; i < m;i++) {
        in>>x>>y;
        g[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        if(!seen[i])
            dfs(i);

    for(int i = sol.size()-1;i >= 0;i--)
        out<<sol[i]<< " ";
}