#include <cstdio>
#include <vector>
#include <stack>
#define MAX 50001
using namespace std;

vector<int>U[MAX];
stack<int>S;
int n,m;
bool viz[MAX];

void dfs(int x){
    for(int i=0;i<U[x].size();i++)
    if(viz[U[x][i]]==0)
    {
        viz[U[x][i]]=1;
        dfs(U[x][i]);
    }
    S.push(x);
}

int main(){
    int x,y;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=m;i++)
        {
            scanf("%d %d",&x,&y);
            U[x].push_back(y);
        }
    for(int i=1;i<=n;i++)
    if(viz[i]==0)
    {
        viz[i]=1;
        dfs(i);
    }
    while(S.size()>0){
        printf("%d ",S.top());
        S.pop();
    }
    return 0;
}