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

using namespace std;

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

const int N=50001;
vector<int> a[N];
int n,m,stop[N],k;
bool viz[N];

void citire()
{
    int x,y,i;
    in>>n>>m;
    for(i=1; i<=m; i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    in.close();
}

void dfs(int nod)
{
    viz[nod]=1;
    for(size_t i=0; i<a[nod].size(); i++)
        if(viz[a[nod][i]]==0)
            dfs(a[nod][i]);
    stop[++k] = nod;
}

int main()
{
    int i;
    citire();
    for(i=1; i<=n; i++)
        if(viz[i]==0)
            dfs(i);
    for(i=n; i>=1; i--)
        out<<stop[i]<<" ";
    return 0;
}