#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int x,y,n,i,k,b[50001],c[50001],m;
vector<int> a[50001];
queue<int> q;
int main()
{
    in>>n>>m;

    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        b[y]++;
    }
    for(i=1;i<=n;i++)
        if(b[i]==0)
        {
         q.push(i);
         k++;
         c[k]=i;
        }
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<a[x].size();i++)
        {
            b[a[x][i]]--;
            if(b[a[x][i]]==0)
            {
             q.push(a[x][i]); k++;
             c[k]=a[x][i];
            }
        }
    }
    for(i=1;i<=n;i++)
        out<<c[i]<<" ";
    return 0;
}