#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m;
vector < vector <int> > G;
vector <int> viz;
stack <int> topo;

void dfs (int nod)
{
    viz[nod]=1;
    for (int i=0;i<G[nod].size();i++)
    {
        int next=G[nod][i];
        if (viz[next]==0)
            dfs(next);
    }
    topo.push(nod);
}

int main()
{
    fin>>n>>m;
    G.resize(n+1);
    viz.resize(n+1);
    for (int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        G[x].push_back(y);
    }
    dfs(1);
    while (topo.size()>0)
    {
        fout<<topo.top()<<" ";
        topo.pop();
    }
    return 0;
}