#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <cstdio>
//#include <bits/stdc++.h>
#define fastio std :: ios_base :: sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
using namespace std;

/*struct order
{
    int nod, cost;
    bool operator < (const order &x) const
    {
        return cost > x.cost;
    }
};

std::priority_queue <order> pq;*/
std::vector <int> v[100010];
std::vector <int> :: iterator it;
int n, m, x, y, viz[50010];

void dfs(int nod)
{
    viz[nod] = 1;
    cout << nod << ' ';
    for(auto it: v[nod])
        if(!viz[it])
            dfs(it);
}

int main(void)
{
    //header ->
    {
        fastio
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        freopen("sortaret.in", "r", stdin);
        freopen("sortaret.out", "w", stdout);
    }

    //input ->
    {
        cin >> n >> m;
        for(int i = 1; i <= m; i++)
        {
            cin >> x >> y;
            v[x].push_back(y);
        }
    }

    //start of the program ->
    {

    }

    //output ->
    {
        for(int i = 1; i <= n; i++)
            if(!viz[i])
                dfs(i);
    }
    exit(0);
}