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


int n, m, i, x, y, k, j, v[100002];
bool ap[100002];
vector<int>G[100002];

void dfs(int x)
{
    ap[x]=1;
    for (int i=0; i<G[x].size(); i++)
        if (ap[G[x][i]]==0) dfs(G[x][i]);
    v[++k]=x;
}

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

    for (int i=1; i<=n; i++)
    {
        if (!ap[i]) dfs(i);
    }
    for (int i=k; i>0; i--)
         g << v[i] << " ";
    return 0;
}