#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int NMAX = 100000 + 5;
int n,m,x,y,st[NMAX],N;
vector <int> g[NMAX];
bool sel[NMAX];
inline void dfs(int x)
{
    sel[x] = true;
    for (int i = 0; i<g[x].size(); ++i)
        if (!sel[g[x][i]])
            dfs[g[x][i]];
    st[++N] = x;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d", &n ,&m);
    for (int i = 1; i<=n ; ++i)
    {
        scanf("%d %d\n", &x, &y);
        g[x].pb(y);
    }
    for (int i = 1; i<=n; ++i)
        if (!sel[i])
            dfs(i);
    for (int i = 1; i<=N; ++i)
        printf("%d ", st[i]);
    return 0;
}