#include <bits/stdc++.h>
using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

const int NMAX=5e4;

int n,m;
int viz[NMAX + 5];
vector<int> gr[NMAX + 5];

int f,l;
int ans[NMAX + 5];

void dfs(int arg)
{
    for(auto it: gr[arg])
    {
        viz[it]--;
        if(!viz[it])
        {
            ans[++l]=it;
            dfs(it);
        }
    }
}

int main()
{
    in>>n>>m;

    while(m--)
    {
        int x,y;
        in>>x>>y;
        gr[x].push_back(y);
        viz[y]++;
    }

    f=1;
    for(int i=1; i<=n; i++)
        if(!viz[i])
            ans[++l]=i;

    while(f<=l)
        dfs(ans[f++]);

    for(int i=1; i<=n; i++)
        out<<ans[i]<<' ';

    return 0;
}