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

vector<int>g[MAX];
stack<int>q;
int n;
bool viz[MAX];

void dfs(int x){
    int y;
    viz[x]=1;
    for(int i=0;i<g[x].size();i++)
    {
        y=g[x][i];
        if(!viz[y])dfs(y);
    }
    q.push(x);
}

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