#include <bits/stdc++.h>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int MAXN = 50000;
vector<int> G[MAXN + 1];
int degree[MAXN + 1];
vector<int> sol;
queue<int> Q;

int N, M;

int main()
{
    fin >> N >> M;
    int a, b;
    while(M--) {
        fin >> a >> b;
        G[a].push_back(b);
        degree[b]++;
    }
    for(int i = 1; i <= N; ++i)
        if(degree[i] == 0)
            Q.push(i);
    while(!Q.empty())
    {
        int x = Q.front();
        Q.pop();
        sol.push_back(x);
        for(const auto& i : G[x])
        {
            degree[i]--;
            if (degree[i] == 0)
                Q.push(i);
        }
    }
    for(const auto& x : sol)
        fout << x << ' ';
}