#include<iostream>
#include<fstream>
#include<queue>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

#define nrm 50005
int n,m;
vector<int>graf[nrm];
bool viz[nrm];
vector<int>rez;

void read()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        graf[x].push_back(y);
    }
}

void dfs(int n)
{
    viz[n]=1;
    for(int i=0;i<graf[n].size();i++)
    {
        int nod=graf[n][i];
        if(viz[nod]==0)
        {
            dfs(nod);
        }
    }
    rez.push_back(n);
}

int main()
{
    read();
    for(int i=1;i<=n;i++)
    {
        if(viz[i]==0)
        {
            cout<<1;
            dfs(i);
        }
    }
    for(int i=rez.size()-1;i>=0;i--)
    {
        fout<<rez[i]<<" ";
    }
    fin.close();
    fout.close();
    return 0;
}