#include <bits/stdc++.h>
#define Dmax 50005
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,in[Dmax];
vector<int>G[Dmax],sol;
queue <int> Q;
int main()
{
    f>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
        in[y]++;
    }
    for(int i = 1; i<= n; i++)
        if(in[i]==0)
        Q.push(i);
    while(!Q.empty())
    {
        int nod = Q.front();
        Q.pop();
        sol.push_back(nod);
        for(vector<int>::iterator it = G[nod].begin(); it < G[nod].end(); it++)
        {
            in[*it]--;
            if(in[*it]==0)
                Q.push(*it);
        }
    }
    for(vector<int>::iterator it = sol.begin(); it < sol.end(); it++)
        g<<*it<<" ";
    return 0;
}