#include <list>
#include <vector>
#include <fstream>
using namespace std;

vector <pair <int,int> > graf[50005];
int n,m;
list <int> topList;
int check[50005]={0};

void read()
{
    int x,y;
    ifstream d("sortaret.in");
    d>>n>>m;
    for (int i=1; i<=m; i++)
    {
        d>>x>>y;
        graf[x].push_back(make_pair(x,y));
    }
}

void dfs(int nod)
{
    vector <pair<int,int> >::iterator it;
    check[nod]=1;
    for (it=graf[nod].begin(); it!=graf[nod].end(); it++)
    {
        if (check[(*it).second]==0) dfs((*it).second);
    }
    topList.push_front(nod);
}

void topSort()
{
    for (int i=1; i<=n; i++)
    {
        if (check[i]==0)
        {
            dfs(i);
        }
    }
}

void write()
{
    ofstream o("sortaret.out");
    list <int>::iterator il;
    for (il=topList.begin(); il!=topList.end(); il++) o<<(*il)<<' ';
}

int main()
{
    read();
    topSort();
    write();
}