#include <cstdio>
#include <vector>
using namespace std;
const int NMAX = 50005;
vector <int> v[NMAX];
vector <int> sol;
bool vf[NMAX];
void dfs(int nod)
{
    if(vf[nod] == 0) {
        sol.push_back(nod);
    }
    vf[nod] = 1;
    for(auto it : v[nod]) {
        if(!vf[it]) {
            dfs(it);
        }
    }
}

int main()
{
    int n, m, i, a, b;
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d", &n, &m);
    for(i = 1;i <= m; ++i) {
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
    }
    for(i = 1;i <= n; ++i) {
        if(!vf[i]) {
            dfs(i);
        }
    }
    for(i = 0;i < sol.size(); ++i) {
        printf("%d ", sol[i]);
    }
    printf("\n");
    return 0;
}