#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int N=100001;
vector<int> a[N];
queue<int> q;
int n,m,pred[N];
void bfs()
{
    int x,y;
    for(int i=1;i<=n;i++)
        if(pred[i]==0)
            q.push(i);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        out<<x<<' ';
        for(size_t i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            pred[y]--;
            if(pred[y]==0)
            {
                q.push(y);
            }
        }
    }
}
int main()
{
    int x,y;
    in>>n>>m;
    for(int i=0;i<m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
        pred[y]++;
    }
    bfs();
    return 0;
}