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

vector<int>v[Max];
deque<int>d,q;
int n;
bool was[Max];

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

int main()
{
    int m,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);
            v[x].push_back(y);
        }

    for(int i=1;i<=n;i++)
    if( !was[i] )
    {
        dfs(i);
        while(q.size() > 0)
        {
            d.push_front(q.front());
            q.pop_front();
        }
    }
    while( d.size() > 0 )
    {
        printf("%d ",d.front());
        d.pop_front();
    }

    return 0;
}