#include <iostream>
#include <stdio.h>
#include <math.h>
#include <stack>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <string.h>

using namespace std;

void sol();

int main() {
#ifdef PADREATI
    freopen("in.txt", "r", stdin);
#else
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
#endif
    sol();
    return 0;
}

vector<vector<int> > G;
int n, m;
int* visit;

void dfs(int i) {
    visit[i]=1;
    vector<int>::iterator it;
    for(it=G[i].begin(); it!=G[i].end(); it++) {
        if(!visit[*it]) {
            dfs(*it);
        }
    }
    printf("%d ", i+1);
}

void sol() {
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; i++) {
        vector<int> v;
        G.push_back(v);
    }
    for (int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        G[b-1].push_back(a-1);
    }
    visit = (int*)calloc(n, sizeof(int));
    for (int i = 0; i < n; i++) {
        if(!visit[i]) {
            dfs(i);
        }
    }
}