#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

const int NMAX = 100002;

int n, m;
vector<int> A[NMAX];
bool viz[NMAX];


void citire()
{
    f >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int x, y;
        f >> x >> y;
        A[y].push_back(x);
    }
}

void DFS(int nod)
{
    viz[nod] = 1;
    for(int i = 0; i < A[nod].size(); i++)
        if(viz[A[nod][i]] == 0)
            DFS(A[nod][i]);
    g << nod << ' ';
}

int main()
{
    citire();
    //
    for(int i = 1; i <= n; i++)
        if(viz[i] == 0)
            DFS(i);
    return 0;
}