# include <cstdio>
# include <vector>
# include <queue>
using namespace std;

FILE *f = freopen("sortaret.in", "r", stdin);
FILE *g = freopen("sortaret.out", "w", stdout);

const int N_MAX = 50001;
queue <int> Q;
vector <int> G[N_MAX];
int grad[N_MAX];

int n, m;

void read()
{
    scanf("%d %d", &n, &m);

    for (int i=1; i<=m; i++)
    {
        int x, y;

        scanf("%d %d", &x, &y);

        grad[y] ++;

        G[x].push_back(y);
    }

    for (int i=1; i<=n; i++)
    {
        if (grad[i] == 0)
            Q.push(i);
    }
}

void sort_top()
{
    while (!Q.empty())
    {
        int nod = Q.front();
        printf("%d ", nod);
        Q.pop();

        for (int i=0; i<G[nod].size(); i++)
        {
            grad[G[nod][i]] --;

            if (grad[G[nod][i]] == 0)
                Q.push(G[nod][i]);
        }
    }
}

int main()
{
    read();
    sort_top();
    return 0;
}