#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout("sortaret.out");
int n,m,sol[50002],nr;
vector<int>v[50002];
bool viz[50002];


void dfs (int k)
{
    viz[k]=1;
    for (auto x:v[k])
        if (viz[x]==0)
            dfs (x);
    sol[++nr]=k;
}


int main()
{
    fin>>n>>m;
    int x,y,i ;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        if (viz[i]==0)
            dfs (i);
    for (i=nr;i>0;i--)
        fout<<sol[i]<<' ';
    return 0;
}