#include <iostream>
#include <fstream>
#include <queue>
#define N 50010
#define M 100010

using namespace std;

vector<int> edges[N];
queue<int> vertices;
int g[N], n, m;

void solve()
{
    ofstream fout("sortaret.out");
    vector<int>::iterator ind;
    int node;
    for (int i=1; i<=n; i++)
        if (!g[i])
            vertices.push(i);
    for (int i=1; i<=n; i++)
    {
        node=vertices.front();
        vertices.pop();
        for (ind=edges[node].begin(); ind!=edges[node].end(); ind++)
        {
            g[*ind]--;
            if (g[*ind]==0)
                vertices.push(*ind);
        }
        /**for (int i=0; i<edges[node].size(); i++)
        {
            g[edges[node][i]]--;
            if (g[edges[node][i]])
                vertices.push(edges[node][i]);
        }*/
        fout << node << " ";
    }
}

int main()
{
    ifstream fin("sortaret.in");
    int x, y;
    fin >> n >> m;
    for (int i=1; i<=m; i++)
    {
        fin >> x >> y;
        edges[x].push_back(y);
        g[y]++;
    }
    solve();
    return 0;
}