#include <iostream>
#include <fstream>
#include <queue>
#include <set>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int NMAX = 50001;
int n, m, GradInt[NMAX];
vector<int> G[NMAX];
set<int> S;
priority_queue<int, vector<int>, greater<int>> Q;
void citire()
{
    int x, y;
    f >> n >> m;
    while(m--)
    {
        f >> x >> y;
        G[x].push_back(y);
        GradInt[y]++;
    }
}
void SortareTopologica()
{
    for(int i = 1; i <= n; i++)
        if(!GradInt[i]) S.insert(i);
    while(!S.empty())
    {
        int crt = *(S.begin());
        S.erase(crt);
        g << crt << ' ';
        for(const int &x : G[crt])
        {
            GradInt[x]--;
            if(!GradInt[x]) S.insert(x);
        }
    }
}
int main()
{
    citire();
    SortareTopologica();
    f.close();
    g.close();
    return 0;
}