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

int n,m;
bool was[Max];
vector<int>v[Max];
stack<int>s;

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

int main(){
    int a,b;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d %d",&n,&m);
    while(m--)
    {
        scanf("%d %d",&a,&b);
        v[a].push_back(b);
    }

    for(int i=1;i<=n;i++)
    if( !was[i] )dfs(i);

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

    return 0;
}