#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

vector <int> v[50001];

stack <int> stiva;

bool viz[50001];

void dfs(int x)
{
    viz[x]=true;
    for(auto y:v[x])
        if(!viz[y])
            dfs(y);
    stiva.push(x);
}

int main()
{
    int n,m;
    in>>n>>m;
    for(int i=1;i<=m;i++){
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    while(!stiva.empty()){
        out<<stiva.top()<<' ';
        stiva.pop();
    }
    return 0;
}