#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,f[100010],x,y;
vector <int> v[100010],raspuns;
int top(int nod){
    f[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(f[v[nod][i]]==0)
            top(v[nod][i]);
    raspuns.push_back(nod);
  //  fout<<nod;
}

int main(){
    fin>>n>>m;
    for(int i=1;i<=m;i++){
        fin>>x>>y;
        v[x].push_back(y);
        //v[y].push_back(x);
    }
    for(int i=1;i<=n;i++)
        if(f[i]==0)
            top(i);
    for(int i=raspuns.size()-1;i>-1;i--)
        fout<<raspuns[i]<<" ";

    return 0;
}