#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m;
vector<int> G[100010];
vector<int> ans;
int vis[100001];

void dfs(int nod) {
    vis[nod] = 1;
    for(auto nodnou : G[nod]) {
        if(vis[nodnou]) {
            dfs(nodnou);
        }
    }
    ans.push_back(nod);
}

int main() {
    cin >> n >> m;
    for(int i = 1; i <= m; ++i) {
        int x, y; cin >> x >> y;
        G[x].push_back(y);
    }

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

    for(auto x : ans) cout << x << ' ';

}