#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int NMAX = 100;

vector <int> edges[NMAX + 1];
int indegree[NMAX + 1];

bool viz[NMAX + 1];

void sortaret(int node) {
    viz[node] = 1;
    for(auto child : edges[node]) {
        if(!viz[child]) {
            sortaret(child);
        }
    }
    fout << node << ' ';
}
int main () {
    int n, m, i, a, b;
    fin >> n >> m;
    for(i = 1; i <= m; i++) {
        fin >> a >> b;
        edges[b].push_back(a);
        indegree[a]++;
    }
    for(i = 1; i <= n; i++) {
        if(indegree[i] == 0) {
            sortaret(i);
        }
    }
    return 0;
}