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

using namespace std;

vector <int> v[1000];
int viz[1000],n,m;
stack<int> q;

fstream f("sortaret.in");
ofstream g("sortaret.out");



void DF(int i){
int j;

for(j=0;j<v[i].size();j++){
    if(viz[v[i][j]]==0){
            viz[v[i][j]]=1;
        DF(v[i][j]);
        q.push(v[i][j]);
    }
}

}


int main()
{ int x,y,i,j;

    f>>n>>m;

    for(i=1;i<=m;i++)
    f>>x>>y, v[x].push_back(y);;

for(i=1;i<=n;i++)
if(viz[i]==0){
        viz[i]=1;
DF(i);
q.push(i);
}

while(q.size()!=0){
    g<<q.top();
    q.pop();
}

    return 0;
}