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

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

const int NMAX = 5e4 + 5;

vector <int> g[NMAX];
int visitat[NMAX];

void dfs (int nod, queue<int>& order) {
    visitat[nod] = 1;
        for (auto neigh: g[nod]) {
            if (visitat[nod] == 0) {
                dfs(neigh, order);
            }
        }
    order.push(nod);
}


void sortare_topologica(int size) {
    for (int i = 0; i < size; i++) {
        visitat[i] = 0;
    }
    queue<int> order;
    for (int i = 1; i <= size; i++) {
        dfs(i, order);
    }

    while(!order.empty()) {
        int nod = order.front();
        fout << nod << " ";
        order.pop();

    }

    
}

int main () {
    int n, m, x, y;
    fin >> n >> m;
    for (int i = 0; i < m; i++) {
        fin >> x >> y;
        g[x].push_back(y);
    }

    sortare_topologica(n);
}