#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<vector<int>> G;
unsigned int n, m, i;
vector<int> grd;
void rd()
{
    int x, y;
    f>>n>>m;
    grd.resize(n+1);
    G.resize(n+1);
    while(f>>x>>y)
    {
        G[x].push_back(y);
        grd[y]++;
    }
}
queue<int> q;
void topsort()
{
    unsigned int x;
    for(x=1;x<=n;x++)
        if(!grd[x])
            q.push(x);
    while(q.size())
    {
        x=q.front();
        q.pop();
        g<<x<<' ';
        for(auto a:G[x])
        {
            grd[a]--;
            if(!grd[a])
                q.push(a);
        }
    }
}
int main()
{
    rd();
    topsort();
    f.close();
    g.close();
    return 0;
}