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

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int> G[50100], result;
int viz[50100];
int n, m;

void DFS(int x)
{
    if(!viz[x])
    {
        viz[x] = 1;
        for(int i = 0; i < G[x].size(); i++)
        {
            if(!viz[G[x][i]]) DFS(G[x][i]);
        }
        result.push_back(x);
    }
}

int main()
{
    f >> n >> m;
    while(m--)
    {
        int a, b;
        f >> a >> b;
        G[a].push_back(b);
    }
    DFS(1);
    for(int i = 0; i < result.size(); i++)
        g << result[i] << ' ';
    f.close();
    g.close();

    return 0;
}