#include <cstdio>
#include <vector>

#define NMAX 50001

using namespace std;

vector <int> G[NMAX];
vector <int> L;

int n;
int viz[NMAX];

void read()
{
    freopen ("sortaret.in", "r", stdin);

    int m;
    int x;
    int y;

    scanf("%d %d\n", &n, &m);
    while(m --)
    {
        scanf("%d %d\n", &x, &y);
        G[x].push_back(y);
    }
}

void dfs(int x)
{
    unsigned int m = G[x].size();
    for(unsigned int i = 0; i < m; ++ i)
    {
        int y = G[x][i];
        if(!viz[y])
        {
            viz[y] = 1;
            dfs(y);
        }
    }

    L.push_back(x);
}

void solve()
{
    for(int i = 1; i <= n; ++ i)
        if(!viz[i])
        {
            viz[i] = 1;
            dfs(i);
        }
}

void write()
{
    freopen("sortaret.out", "w", stdout);

    while(!L.empty())
    {
        printf("%d ", L.back());
        L.pop_back();
    }

    printf("\n");
}

int main()
{
    read();
    solve();
    write();

    return 0;
}