#include <iostream>
#include <vector>
#include <cstdio>
#include <queue>

using namespace std;

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    int n, m;
    cin >> n >> m;
    vector<int> out[n + 1];
    vector<int> in[n + 1];
    vector<int> outDegree(n, 0);

    for(int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        --a;
        --b;
        out[a].push_back(b);
        ++outDegree[a];
        in[b].push_back(a);
    }

    vector<int> output;
    queue<int> q;

    for(int i = 0; i < n; ++i)
    {
        if(outDegree[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {
        int currentVertex = q.front();
        output.push_back(currentVertex);
        for(int i = 0; i < in[currentVertex].size(); ++i)
        {
            int x = --outDegree[in[currentVertex][i]];
            if(x == 0)
                q.push(in[currentVertex][i]);
        }
        q.pop();
    }
    for(int i = n - 1; i >= 0; --i)
    {
        cout << output[i] + 1 << ' ';
    }

    return 0;
}