#include <fstream>
#include <vector>
#define MAXN 50003
using namespace std;
ifstream fi("sortaret.in");
ofstream fo("sortaret.out");
int x,i,j,n,m, k,viz[MAXN], sol[MAXN];
vector<int> G[MAXN];
void DF(int nod){
int i;
viz[nod]=1;
for(i=0;i<G[nod].size();i++)
    if(viz[G[nod][i]]==0)DF(G[nod][i]);
sol[++k]=nod;
}

void citire_graf(){
    int i,x,y;
    fi>>n>>m;
    for(i=1;i<=m;i++)
    {
        fi>>x>>y;
        G[x].push_back(y);
    }
}

int main(void)
{
citire_graf();

for(i=1;i<=n;i++)
    if(viz[i]==0)DF(i);

for(i=k;i>=1;i--)fo<<sol[i]<< " ";
//for(i=1;i<=n;i++) //afis liste de adiacenta
//{
//    fo<<i<<" -> ";
//    for(j=0;j<G[i].size();j++)fo<<G[i][j]<<" ";
//    fo<<endl;
//}
    return 0;
}