#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int NMAX =  50000;
vector<int> g[NMAX + 5];
int grad[NMAX + 5];
queue<int> q;
bitset<50005> viz;
int n, m;

void sortare_t()
{
    while(!q.empty())
    {
        int node = q.front();
        q.pop();

        out << node << ' ';

        for(auto it : g[node])
        {
            grad[it]--;
            if(grad[it] == 0)
            {
                q.push(it);
            }
        }
    }
}

int main()
{
    in >> n >> m;

    for(int i = 1; i <= m; ++i)
    {
        int u, v;
        in >> u >> v;

        g[u].push_back(v);
        ++grad[v];
    }
    for(int i = 1; i <= n; ++i)
    {
        if(grad[i] == 0)
        {
            q.push(i);
        }
    }

    sortare_t();
}