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

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

const int NLIM = 50005;

int n, m;
vector < int > edges[NLIM];
int degree[NLIM];
void read() {
    fin >> n >> m;
    int x, y;
    for (int i = 1; i <= m; ++i) {
        fin >> x >> y;
        edges[x].push_back(y);
        ++degree[y];
    }
}

bitset < NLIM > viz;
void solve_and_write() {
    for(int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j)
            if (!viz[j] && !degree[j]) {
                viz[j] = 1;
                fout << j << ' ';
                for (unsigned int k = 0; k < edges[j].size(); ++k)
                    --degree[ edges[j][k] ];
                break;
            }
    }
}

int main() {
    read();
    solve_and_write();
}