#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50000];
queue <int> coada;
pair<int,bool> grad[50000];
int main() {
    int n, m;
    fin >> n >> m;
    for(int i = 1;i <= m; ++i)
    {
        int a,b;
        fin >> a >> b;
        grad[b].first +=1;
        v[a].push_back(b);
    }
    for(int i = 1;i <= n; ++i)
        grad[i].second=false;
    for(int i = 1;i <= n; ++i)
        if(grad[i].first == 0)
        {
            coada.push(i);
            grad[i].second = true;
        }
    while(!coada.empty())
        {
           int nod = coada.front();
           coada.pop();
           for(auto x : v[nod])
               grad[x].first -= 1;
           fout<< nod <<" ";
            for(int i = 1;i <= n; ++i)
                if(grad[i].first == 0 and grad[i].second == false)
                {
                    grad[i].second=true;
                    coada.push(i);
                }
        }
    return 0;
}