#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> v[500001];
int grad[500001];
int n;
void solve()
{
    queue<int> Q;
    for(int i=1;i<=n;i++)
    {
        if(grad[i]==0)
        {
            Q.push(i);
        }
    }
    while(!Q.empty())
    {
        int node=Q.front();
        fout<<node<<' ';
        Q.pop();
        for(auto it:v[node])
        {
            grad[it]--;
            if(grad[it]==0)
            {
                Q.push(it);
            }
        }
    }
}
int main()
{
    int m,a,b;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
        grad[b]++;
    }
    solve();
}