#include <bits/stdc++.h>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
vector<vector<int>> L;
vector<int> viz;
queue<int> q;
vector<int> I;

void BFS()
{
    while(!q.empty())
    {
        int k = q.front();
        fout << k << " ";
        q.pop();
        for(const auto& w: L[k])
            {
                I[w]--;
                if(I[w] == 0) q.push(w);
            }
    }
}

int main()
{
    int i, x, y;
    fin >> n >> m;
    L.resize(n + 1);
    viz.resize(n + 1, 0);
    I.resize(n + 1, 0);
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
        I[y]++;
    }   
    for(i = 1; i <= n; i++)
        if(I[i] == 0) q.push(i);
    BFS();
    fin.close();
    fout.close();
    return 0;
}