#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int>l[50005],c;
int sel[50005];
void dfs(int x){
sel[x]=true;
for(int i=0;i<l[x].size();i++)
    if(!sel[l[x][i]])dfs(l[x][i]);
c.push_back(x);
}
int i,x,y;
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(i=1;i<=m;i++){
        scanf("%d %d",&x,&y);
        l[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(!sel[i])dfs(i);
        reverse(c.begin(),c.end());
    for(i=0;i<c.size();++i)
        printf("%d ",c[i]);

    return 0;
}