#include <fstream>
#include <vector>

using namespace std;

const int MAXN = 50002;

vector<int> g[MAXN];
int grad[MAXN];
bool vis[MAXN];
ofstream out("sortaret.out");

void removeNode(int n)
{
    out << n << ' ';
    vis[n] = 1;
    for (int i = 0; i < g[n].size(); i++)
    {
        if (!vis[g[n][i]])
        {
            grad[g[n][i]]--;
            if (grad[g[n][i]] == 0)
                removeNode(g[n][i]);
        }
    }
}

int main()
{
    ifstream in("sortaret.in");

    int n, m;
    in >> n >> m;

    int x, y;
    while (m--)
    {
        in >> x >> y;
        grad[y]++;
        g[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
    {
        if (grad[i] == 0 && !vis[i])
            removeNode(i);
    }
    out << '\n';

    return 0;
}