#include <bits/stdc++.h>

using namespace std;

#define Nmax 100010

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

int n,m,x,y;
vector<int>g[Nmax];
int viz[Nmax];
vector<int> topo;

void dfs(int x)
{
    viz[x] = 1;
    for(int i = 0; i < g[x].size(); ++i)
    {
        if(viz[g[x][i]] == 0)
            dfs(g[x][i]);
    }
    topo.push_back(x);
}

int main()
{

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

    for(int i=1; i<=n; i++)
    {
        if(viz[i] == 0)
        {
            dfs(i);
        }
    }

    reverse(topo.begin(), topo.end());

    for(int i = 0; i< topo.size(); i++)
        fout << topo[i] << ' ';

    return 0;
}