#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m;
int inDegree[100100];
vector<int> edges[100100];
queue<int> q;

void Sort()
{
    int i,j;

    for(i=1;i<=n;i++)
        if(inDegree[i] == 0)
        {
            q.push(i);
            g<<i<<" ";
        }

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

        for(i=0;i<edges[node].size();i++)
            if( -- inDegree[edges[node][i]] == 0)
            {
                q.push(edges[node][i]);
                g<<edges[node][i]<<" ";
            }

        q.pop();
    }
}



int main()
{
    int i,j,x,y;

    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;

        edges[x].push_back(y);
        inDegree[y]++;

    }

    Sort();




    f.close();
    g.close();
    return 0;
}