#include <iostream>
#include <vector>
#include <array>
#include <list>
#include <algorithm>
#include <utility>
#include <type_traits>
#include <functional>
#include <cstdint>
#include <thread>
#include <limits>
#include <cassert>
#include <string>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <bitset>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <regex>
#include <future>

std::ofstream g{ "sortaret.out" };

enum { SIZE = 50001 };

int num_nodes, num_arcs;

std::array<std::vector<int>, SIZE> graph;
std::array<bool, SIZE> visited;
std::vector<int> final_sort; // treat it as a stack
                             // vector for contiguous memory

void read()
{
    std::ifstream f{ "sortaret.in" };

    f >> num_nodes >> num_arcs;

    int node1, node2;

    for(int i = 1; i < num_nodes; ++i) {
        for(int j = 1; j < num_arcs; ++j) {
            f >> node1 >> node2;

            graph[node1].push_back(node2);
        }
    }
}

void dfs(int const t_node)
{
    visited[t_node] = true;

    for(auto const& t_neighbour : graph[t_node]) {
        if(!visited[t_neighbour]) {
            dfs(t_neighbour);
        }
    }

    final_sort.push_back(t_node);
}

int main()
{
    read();

    final_sort.reserve(num_nodes);

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

    for(auto it = final_sort.rbegin(); it != final_sort.rend(); ++it) {
        g << *it << ' ';
    }

    return 0;
}