#include <cstdio>
#include <cstring>

#include <queue>
#include <vector>

using namespace std;

const int MAXN = 50001;

vector<int> G[MAXN];

int indeg[MAXN];

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    int n, m;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < m; ++i) {
        int x, y;
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
        indeg[y]++;
    }

    vector<int> sol;
    queue<int> q;
    for (int i = 1; i <= n; ++i)
        if (indeg[i] == 0)
            q.push(i);

    while (!q.empty()) {
        int node = q.front();
        sol.push_back(node);
        q.pop();

        vector<int>::iterator it;
        for (it = G[node].begin(); it != G[node].end(); ++it) {
            indeg[*it]--;
            if (indeg[*it] == 0)
                q.push(*it);
        }
    }

    for (int i = 1; i <= n; ++i)
        if (indeg[i] != 0) {
            printf("No solution\n");
            return 0;
        }

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