#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>

using namespace std;

int N, M;
vector<int> L[50001];
vector<int> T;
int deg[50001];

void topsort()
{
    queue<int> q;
    for(int i = 1; i <= N; i++)
        if(deg[i] == 0)
            q.push(i);

    while(!q.empty())
    {
        int u = q.front();
        T.push_back(u);
        q.pop();

        for(const auto& v : L[u])
        {
            deg[v]--;
            if(deg[v] == 0)
                q.push(v);
        }
    }
}

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

    fin >> N >> M;
    
    for(int i = 1; i <= M; i++)
    {
        int a, b;
        fin >> a >> b;
        deg[b]++;
        L[a].push_back(b);
    }

    topsort();

    for(const auto& u : T)
        fout << u << ' ';

    fin.close();
    fout.close();

    return 0;
}