#include <fstream>
#include<vector>
#define MAX 100003
#include<queue>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> gr[MAX];
queue <int> q;
int n,m,viz[MAX],s,grad[MAX];
void sortare()
{
    int i;
    for(i=1;i<=n;i++)
        if(grad[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        g<<nod<<" ";
        for(i=0;i<gr[nod].size();i++)
        {
            grad[gr[nod][i]]--;
            if(grad[gr[nod][i]]==0)
                q.push(gr[nod][i]);
        }
    }


}
int main()
{
    f>>n>>m;
    int i,x,y;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        gr[x].push_back(y);
        grad[y]++;
    }
    sortare();
    return 0;
}