#include <fstream>
#include <vector>

#define N 50002

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

vector <int> G[N];
int n, m, c[N], grad[N];
vector<int>::iterator it;


int main()
{
    in >> n >> m;
    int i, a, b;
    for(i = 1; i <= m; i++)
    {
        in >> a >> b;
        G[a].push_back(b);
        grad[b]++;
    }
    int lcoada = 0, x;
    for(i = 1; i <= n; i++)
        if(grad[i] == 0)
        {
            lcoada++;
            c[lcoada] = i;
        }
    for(i = 1; i <= n; i++)
    {
        x = c[i];
        for(it = G[x].begin(); it < G[x].end(); ++it)
        {
            grad[*it]--;
            if(grad[*it] == 0)
            {
                lcoada++;
                c[lcoada] = *it;
            }
        }
    }
    for(i = 1; i <= n; i++)
        out<<c[i]<<" ";


    return 0;
}