#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

int n, m;
bool viz[50005];
vector<int> graph[50005];
vector<int> sol;

void dfs(int x);


int main()
{
    int x, y;

    in >> n >> m;

    for (int i = 1; i <= n; ++i) {
        graph[i].reserve(2);
    }

    for (int i = 1; i <= m; ++i) {
        in >> x >> y;
        graph[y].push_back(x);
    }

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

    int size = sol.size();
    for (int i = 0; i < size; ++i) {
        out << sol[i] << ' ';
    }

    return 0;
}


void dfs(int x) {
    viz[x] = true;

    int size = graph[x].size();
    for (int i = 0; i < size; ++i) {
        int y = graph[x][i];
        if (!viz[y]) {
            dfs(y);
        }
    }

    sol.push_back(x);
}