#include <cstdio>
#include <vector>
#define SIZE 50001
using namespace std;
int n, m, i, x, y, sol[SIZE];
vector <int> v[SIZE];
bool viz[SIZE], sw;
void DFS(int node)
{
    viz[node]=1;
    for(int i=0;i<v[node].size();++i)
        if(!viz[v[node][i]])
            DFS(v[node][i]);
    sol[++sol[0]]=node;
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d %d", &n, &m);
    for(i=1;i<=m;++i)
    {
        scanf("%d %d", &x, &y);
        v[x].push_back(y);
    }
    for(i=1;i<=n;++i)
        if(!viz[i])
            DFS(i);

    for(i=sol[0];i>=1;--i)
        printf("%d ", sol[i]);
    printf("\n");
    return 0;
}