#include <bits/stdc++.h>

using namespace std;

int n, m;
vector<int> graf[50005];
int nri[50005];
vector<int> ans;

void topsort()
{
    queue<int> q;
    for (int i = 1; i <= n; i ++)
    {
        if (nri[i] == 0)
            q.push(i);
    }
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        ans.push_back(nod);
        for (auto i : graf[nod])
        {
            nri[i] --;
            if (nri[i] == 0)
            {
                q.push(i);
            }
        }
    }
}

int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin >> n >> m;
    for (int i = 1; i <= m; i ++)
    {
        int a, b; cin >> a >> b;
        graf[a].push_back(b);
        nri[b] ++;
    }
    topsort();
    for (auto i : ans)
    {
        cout << i << ' ';
    }
    return 0;
}