#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int lmt=5e4;

vector<int> alist[lmt],rsp, finAnsw;
int n,m;
bool viz[lmt];

void DFS(int nod)
{
    viz[nod]=1;
    vector<int>::iterator i;
    for(i=alist[nod].begin();i!=alist[nod].end();++i)
    {
        if(!viz[*i])
            DFS(*i);
    }
    rsp.push_back(nod);

}

int main()
{
    fin>>n>>m;
    int x,y;
    for(int i=0;i<m;++i)
    {
        fin>>x>>y;
        alist[x].push_back(y);
    }
    for(int i=1;i<=n;++i)
    {
        if(!viz[i])
        {
            DFS(i);
            vector<int>::iterator i;
            for(i=rsp.begin();i!=rsp.end();++i)
                finAnsw.push_back(*i);

            rsp.clear();
        }
    }
    reverse(finAnsw.begin(),finAnsw.end());
    vector<int>::iterator i;
    for(i=finAnsw.begin();i!=finAnsw.end();++i)
        fout<<*i<<' ';

    fout<<endl;
    return 0;
}