#include <bits/stdc++.h>
#define MAX 50100

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector < int > G[MAX];
int n, m;
bool viz[MAX];
vector < int > afish;

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

void dfs(int node){
    afish.push_back(node);
    viz[node] = 1;
    for (int i = 0; i < G[node].size(); i++){
        int newnode = G[node][i];
        if (!viz[newnode]){
            dfs(newnode);
        }
    }
}

void topsort(){
    for (int i = 1; i <= n; i++){
        if (viz[i] == 0){
            dfs(i);
        }
    }
}

void afis(){
    for (int i = 0; i < afish.size(); i++){
        g << afish[i] << ' ';
    }
}

int main()
{
    citeste();
    topsort();
    afis();
    return 0;
}