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

using namespace std;

ifstream fi("sortare.in");
ofstream fo("sortare.out");

int deg[5003];

int main()
{
    int n,m;

    vector <int> gr[5003];
    queue  <int> q;

    fi>>n>>m;

    for(int i=0;i<m;i++)
    {
        int a,b;

        fi>>a>>b;

        gr[a].push_back(b);
        deg[b]++;
    }

    for(int i=1;i<=n;i++)
        if(!deg[i])
            q.push(i);

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

        fo<<node<<" ";

        for(int i=0;i<gr[node].size();i++)
        {
            deg[gr[node][i]]--;
            if(!deg[gr[node][i]])
                q.push(gr[node][i]);
        }

    }

    return 0;

}