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

vector<int>g[MAX];
stack<int>s;

int n;
bool was[MAX];

void dfs(int x){
    int y;
    was[x] = 1;
    for(int i=0;i<g[x].size();i++)
    {
        y = g[x][i];
        if( !was[y] ) dfs(y);
    }
    s.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( !was[i] ) dfs(i);

    while( s.size() > 0 )
    {
        printf("%d ",s.top());
        s.pop();
    }

    return 0;
}