#include <bits/stdc++.h>
using namespace std;
const int NMAX=100005;
int grad[NMAX];
vector<int>v[NMAX];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        cin>>a>>b;
        v[a].push_back(b);
        grad[b]++;
    }
    queue<int>q;
    for(int i=1;i<=n;i++)
    {
        if(grad[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        cout<<q.front()<<" ";
        int r=q.front();
        q.pop();
        for(auto i:v[r])
        {
            grad[i]--;
            if(grad[i]==0)
                q.push(i);
        }
    }
    return 0;
}