#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
bool viz[500001];
vector <int> sol;
vector <int> adiacenta[50001];
void input(){
    fin>>n>>m;
    int x,y,i;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        adiacenta[x].push_back(y);

    }
}

void dfs(int x){
    viz[x] = 1;
    for(int i=0;i<adiacenta[x].size();i++){
        if(!viz[x])
            dfs(x);
    }
    sol.push_back(x);
}

int main()
{
    input();
    int j;
    for(j=1;j<=n;j++){
        if(viz[j]==0)
            dfs(j);
    }
    for(j=0;j<sol.size();j++)
        fout<<sol[j]<<" ";
    fin.close();
    fout.close();
    return 0;
}