#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define N 50003
using namespace std;
vector <int> a[N];
queue <int> q;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
int v[N];
void Read()
{
    fin>>n>>m;
    int x,y;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }

}
void DFS(int k)
{
    v[k]=1;
    int i,len;
    len=a[k].size();
    for(i=0; i<len; i++)
    if(!v[a[k][i]])
    {
        v[a[k][i]]=1;
        DFS(a[k][i]);
    }
    q.push(k);
}
int main()
{
    int i;
    Read();
    for(i=1; i<=n; i++)
    if(!v[i])
    DFS(i);

    int len=q.size();
    while(!q.empty())
    {
        cout<<q.front()<<" ";
        q.pop();
    }

    return 0;
}