#include <iostream>
#include <fstream>
#include<vector>
#include <queue>
using namespace std;
ifstream f ("sortaret.in");
ofstream g ("sortaret.out");
int n,m,nr;
bool viz[50001];
int grad_intern[50001];
queue<int>q;
vector<int>adiacenta[50001];
void sortare()
{
    for(int i = 1;i<=n;i++)
    {
        if(grad_intern[i] == 0)
            {
                g << i << " ";
                viz[i] = 0;
                q.push(i);
            }
    }
    while(!q.empty())
    {
        int curent = q.front();
        q.pop();
        for(auto x:adiacenta[curent])
        {
            grad_intern[x]--;
            if(grad_intern[x] == 0 && !viz[x])
            {
                g << x<< " ";
                viz[x] = 1;
                q.push(x);
            }
        }
    }
}
int main()
{
    f >> n >> m;
    for(int i = 1;i<=m;i++)
    {
        int x,y;
        f >> x >> y;
        adiacenta[x].push_back(y);
        //grradul intern reprezinta numarul de sageti care intra in y
        grad_intern[y]++;
    }
    sortare();
}