#include <iostream>
#include <queue>

using namespace std;

int m, n;
bool edge[21][21];
int d[21];

int main()
{
    cin >> m >> n;
    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;

        x--, y--;
        edge[y][x] = true;
        d[y]++;
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            if (d[j] == 0) {
                d[j] = -1;
                cout << j + 1 << endl;
                for (int k = 0; k < m; k++)
                    if (edge[k][j]) {
                        edge[k][j] = false;
                        d[k]--;
                    }
            }
        }
    }

    return 0;
}