#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector<int>V[50005];
int viz[50005];
int sol[50005];
int cnt;
void DFS(int nod)
{
    viz[nod] = 1;
    for(auto x : V[nod])
        if(viz[x] == 0)
            DFS(x);
    sol[++cnt] = nod;
}
void Citire()
{
    int i, x, y;
    fin >> n >> m;
    for(i = 1;i <= m;i++)
    {
        fin >> x >> y;
        V[x].push_back(y);
    }
    DFS(1);
    for(i = n;i >= 1;i--)
        fout << sol[i] << " ";
}

int main()
{
    Citire();
    return 0;
}