#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n,m,viz[50003];

vector<int>g[50003];
queue<int>sol;

void dfs(int nod)
{
    viz[nod]++;
    sol.push(nod);
    for(vector<int> :: iterator it=g[nod].begin();it!=g[nod].end();it++)
        if(viz[*it]==0)
            dfs(*it);
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            dfs(i);
    while(sol.size())
    {
        fout<<sol.front()<<" ";
        sol.pop();
    }
}