#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin ( "sortaret.in");
ofstream cout("sortaret.out");

vector <vector <int> > a;
vector <int> q; // q == sol
vector <bool> b;

void read()
{
    int n, m;
    cin >> n >> m;
    a.resize(n + 1);
    b.resize(n + 1);

    for (int i = 0, x, y; i < m; i++)
    {
        cin >> x >> y;
        if (x != y && count(a[x].begin(), a[x].end(), y) == 0)
            a[x].push_back(y);
    }

    for (int i = 0; i < a.size(); i++)
        sort(a[i].begin(), a[i].end());
}

void solve(int x)
{
    q.push_back(x);
    b[x] = true;
    for (int i = 0; i < a[x].size(); i++)
        if (!b[ a[x][i] ] ) solve(a[x][i]);
}

void write()
{
    for (int i = 0; i < q.size(); i++)
        cout << q[i] << ' ';
}

int main()
{
    read();

    for (int i = 1; i < b.size(); i++)
        if (!b[i]) solve(i);

    write();

    return 0;
}