#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int grad[100005], rasp[100005];
int nr, k, n, m, a, b;
vector <int> muchii[100005];
queue <int> q;

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        cin >> a >> b;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
        grad[a]++;
    }
    for(int i = 1; i <= n; i++)
    {
        if(grad[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {
        k = q.front();
        rasp[nr++] = k;
        for(int i = 0; i < muchii[k].size(); i++)
        {
            grad[muchii[k][i]]--;
            if(grad[muchii[k][i]] == 0)
                q.push(muchii[k][i]);
        }
        q.pop();
    }
    for(int i = nr - 1; i >= 0; i--)
        cout<<rasp[i]<<" ";

    return 0;
}