#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>

using namespace std;

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

bitset <50010> vaz;
vector <int> v[50010];
int n,m;

void sortare(int nod){
    vaz[nod]=true;
    for (auto i:v[nod])
        if (!vaz[i])
            sortare(i);
    t<<nod<<" ";
}

int main()
{
    f>>n>>m;
    for (int x,y,i=0;i<m;++i){
        f>>x>>y;
        v[y].push_back(x);
    }
    for (int i=1;i<=n;++i)
        if (!vaz[i])
            sortare(i);
    return 0;
}