#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <algorithm>

typedef std::vector<int>::iterator iter;
typedef std::vector<int>::reverse_iterator riter;
#define MAXN 50005



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

int n, m;
std::vector<int> G[MAXN];
std::vector<int> v;
std::bitset<MAXN> viz;



void sortaret(int nd)
{
    for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
        if (viz[*it] == false) {
            sortaret(*it);
        }
    }
    v.push_back(nd);
    viz[nd] = true;
}

int main()
{
    f >> n >> m;
    for (int i = 1, x, y; i <= m; i++) {
        f >> x >> y;
        G[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        if (viz[i] == false) {
            sortaret(i);
        }
    }

    for (riter it = v.rbegin(); it != v.rend(); it++) {
        g << *it << ' ';
    }
    g << std::endl;

    f.close();
    g.close();
    return 0;
}