#include <fstream>
#include <vector>
#define N 50002
#include <deque>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int> graph[N];
bool viz[N];
int v[N];

void sortt(int nod)
{
    viz[nod]=1;
    for(int i=0;i<graph[nod].size();++i)
        if(!viz[graph[nod][i]])
            sortt(graph[nod][i]);
    v[++v[0]]=nod;
}
int main()
{
    int n,m,x,y;
    f>>n>>m;
    while(m--)
    {
        f>>x>>y;
        graph[x].push_back(y);
    }
    for(int i=1;i<=n;++i)
        if(!viz[i])
            sortt(i);
    for(int i=n;i>=1;--i)
        g<<v[i]<<' ';
    f.close();
    g.close();
    return 0;
}