#include <fstream>
#include <vector>
#include <deque>
#include <bitset>
using namespace std;

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

int n, m, x, y;
vector <int> a[50010];
deque <int> q;
bitset <50010> b;

void dfs(int k){
    for(int i=0;i<a[k].size();++i){
        int gg=a[k][i];
        if(!b[gg]) dfs(gg);
    }
    b[k]=1;
    q.push_back(k);

}



int main(){
    fin>>n>>m;
    for(;m;--m){
        fin>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1;i<=n;++i){
        if(!b[i]) dfs(i);
    }
    while(q.size()){
        fout<<q.back()<<' ';
        q.pop_back();
    }


    return 0;
}