#include <cstdio>
#include <algorithm>
#include <vector>
#define NMAX 50005

using namespace std;

int n, m, x, y;
int viz[NMAX];
vector<int> v[NMAX], sol;

void DFS(int nod)
{
    viz[nod]=1;
    for(int i = 0 ; i < v[nod].size(); ++i)
    {
        if (viz[nod] == 0) DFS(v[nod][i]);
    }
    sol.push_back(nod);
}

int main()
{
    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)
    {
        sort(v[i].begin(),v[i].end());
    }

    for(int i = 1; i <= n; ++i)
    {
        if(viz[i] == 0) DFS(i);
    }

    for(int i = 0; i < sol.size(); ++i) printf("%d ",sol[i]);

    return 0;
}