#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;
    while(!q.empty())
    {
        for(i=1;i<=n;i++)
            if(inDegree[i] == 0)
            {
                g<<i<<" ";
                q.push(i);
                inDegree[i] = -1;
                for(j=0;j<edges[i].size();j++)
                    inDegree[edges[i][j]]--;
            }
        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]++;

    }

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

    Sort();




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