#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int MAX = 100001;
vector<int> gr[MAX];
int n, m, viz[MAX], sol[MAX], nsol;
void dfs(int nod) {
    viz[nod] = 1;
    for(int i = 0; i < gr[nod].size(); ++i) {
        int fiu = gr[nod][i];
        if(viz[fiu] == 0) {
            dfs(fiu);
        }
    }
    sol[ ++nsol ] = nod;
}
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;
        gr[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i) {
        if(viz[i] == 0) {
            dfs(i);
        }
    }
    for(int i = nsol; i >= 1; --i) {
        cout << sol[i] << ' ';
    }
    return 0;
}