#include <iostream>
#include <queue>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream fi("sortaret.in");
ofstream fo("sortaret.out");

queue<int> C;
int pred[50001], N, M;
vector<int> t[50001];


void bfs();
void citire();


int main()
{
    citire();
    bfs();
    return 0;
}

void bfs()
{
    for(int i=1;i<=N;i++)
        if(pred[i]==0)
            C.push(i);
    while(!C.empty())
    {
        int nod = C.front();
        C.pop();
        fo<<nod<<' ';
        for(int i=0;i<t[nod].size();i++)
        {
            pred[t[nod][i]]--;
            if(pred[t[nod][i]]==0)
                C.push(t[nod][i]);
        }
    }
    return;
}

void citire()
{
    fi>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fi>>x>>y;
        pred[y]++;
        t[x].push_back(y);
    }
    return;
}