#include<cstdio>
#include<vector>
using namespace std;
const int N=50000;
vector<int>g[N+1];
bool vis[N+1];
int res[N+1];
int nres;
int n,m;
void dfs(int dad){
    vis[dad]=true;
    for(unsigned int i=0;i<g[dad].size();i++){
        int son=g[dad][i];
        if(!vis[son])
            dfs(son);
    }
    res[++nres]=dad;
}
int main(){
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!vis[i])
            dfs(i);
    for(int i=n;i>=1;i--)
        printf("%d ",res[i]);
    return 0;
}