#include <bits/stdc++.h>

using namespace std;
int n, m;
const int NMAX = 50005;
vector<int> graf[NMAX];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
bool viz[NMAX];
stack<int> stac;
void dfs(int node)
{
    for(auto i: graf[node])
    {
        if(!viz[i]) dfs(i);
    }
    stac.push(node);
}
int main()
{
    fin>>n>>m;
    while(m--)
    {
        int a, b;
        fin>>a>>b;
        graf[a].push_back(b);
    }
    dfs(1);
    while(stac.size()) fout<<stac.top()<<" ", stac.pop();
    return 0;
}