#include <bits/stdc++.h>
#include <vector>
#define dimension 50005

using namespace std;

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

int n,m,visited[dimension],degrees[dimension];
vector<int>Graph[dimension];

void read(){
    int i,a,b;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        Graph[a].push_back(b);
        degrees[b]++;
    }
}

void Topological_Sorting()
{
    int i,j,k;
    for(i=1;j<=n;j++)
    {
        for(j=1;j<=n;j++)
        {
            if(visited[j]==0 && degrees[j] == 0)
            {
                visited[j] = 1;
                fout<<j<<" ";
                for(k=0;k < Graph[j].size();k++)
                    degrees[ Graph[j][k] ]-- ;
                break;
            }
        }
    }
}

int main()
{
    read();
    Topological_Sorting();
    fin.close();
    fout.close();
    return 0;
}