#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
queue<int> Stack;
void Sort_top(int nod, int v[], vector<int> graf[])
{
    v[nod]=1;

    for(auto it:graf[nod])
        if(v[it]==0)
           Sort_top(it,v,graf);

    Stack.push(nod);

}

int main()
{
    int n,m;

    fin>>n>>m;
    int v[n+1]={0};
    vector<int> graf[n+1];
    while(m--)
    {
        int x,y;
        fin>>x>>y;
        graf[y].push_back(x);

    }


    for (int i=1; i<=n; i++)
        if(v[i]==0)
            Sort_top(i,v,graf);


    while(Stack.empty()==false)
    {
        fout<<Stack.front()<<" ";
        Stack.pop();
    }

    return 0;
}