#include <fstream>
#include <vector>
#include <queue>
using namespace std;

ifstream is("sortaret.in");
ofstream os("sortaret.out");

vector< vector<int> > G;
queue <int> Q;

int n, m;
int a, b, x;
int gr[50001];

int main()
{
    is >> n >> m;
    G.resize(n+1);
    for(int i = 1; i <= m; ++i)
    {
        is >> a >> b;
        G[a].push_back(b);
        gr[b]++;
    }

    for (int i = 1; i <= n; ++i)
        if (gr[i] == 0)
            Q.push(i);

    while (!Q.empty())
    {
        x = Q.front();
        os << x << ' ';
        Q.pop();
        for (const auto& y : G[x])
        {
            gr[y]--;
            if (gr[y] == 0)
                Q.push(y);

        }
    }

    is.close();
    os.close();
    return 0;
}