#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

#define NMAX 50003

int n,m,x,y,i,j,grad[NMAX],q[NMAX];
vector <int> g[NMAX];

void solve()
{
    for (x=1;x<=n;x++)
    {
        if (grad[x]==0) q[++q[0]]=x;
    }

    for (i=1;i<=n;i++)
    {
        x=q[i];
        for (j=0;j<g[x].size();j++)
        {
            //grad[g[x][j]]--;
            //if (grad[g[x][j]]==0)
            q[++q[0]]=g[x][j];
        }
    }

}

int main()
{
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
        grad[y]++;
    }

    solve();

    for (i=1;i<=n;i++)
    {
        fout<<q[i]<<" ";
    }

    fin.close();
    fout.close();
    return 0;

}