#include<cstdio>
#include<vector>
using namespace std;
vector <int> v[50001];
vector <int> vec;
char viz[50001];
void dfs(int nod){
    int i;
    viz[nod]=1;
    for(i=0;i<v[nod].size();i++)
        if(!viz[v[nod][i]])
            dfs(v[nod][i]);
    vec.push_back(nod);
}
int main(){
    int n,m,i,x,y,ok,j;
    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);
        ok=1;
        for(j=0;j<v[x].size();j++)
            if(v[x][j]==y)
                ok=0;
        if(ok)
            v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    for(i=vec.size()-1;i>=0;i--)
        printf("%d ",vec[i]);
    return 0;
}