#include <iostream>
#include <fstream>
#include <vector>
#define MAX 50005

using namespace std;

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

int n, m, x, y, cnt=1;
vector <int> v[MAX];
int g[MAX];
bool used[MAX];
int sortare[MAX];

void sort_top(int nod)
{
    used[nod]=1;
    for(auto i : v[nod])
    {
        if(used[i]==0)
            sort_top(i);
    }
    sortare[cnt++]=nod;
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[y].push_back(x);
        g[x]++;
    }
    for(int i=1; i<=n; i++)
        if(g[i]==0)
            sort_top(i);
    for(int i=1; i<cnt; i++)
        fout<<sortare[i]<<" ";
    return 0;
}