#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int NMAX=50005;
vector<int>v[NMAX];
int sol[NMAX];
bool fr[NMAX];
int cnt=0;
void dfs(int poz)
{
    fr[poz]=1;
    for(register int i=0;i<v[poz].size();i++)
    {
        if(fr[v[poz][i]])continue;
        dfs(v[poz][i]);
    }
    sol[++cnt]=poz;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int i,j,n,m,x,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=1;i<=n;++i)
    {
        if(!fr[i])
            dfs(i);
    }
    for(i=cnt;i>=1;--i)printf("%d ",sol[i]);
    return 0;
}