#include <bits/stdc++.h>

std :: ifstream in ("sortaret.in");

std :: ofstream out ("sortaret.out");

const int NMAX = 5e4 + 5;

int n;

int m;

int x;

int y;

std :: vector <int> v[NMAX];

int intrari[NMAX];

std :: queue <int> q;

bool visited[NMAX];

void tsort()
{
    while(!q.empty())
    {
        int nod = q.front();

        q.pop();

        if(visited[nod] == 0)
        {

            visited[nod] = true;


            out << nod << " ";

            for(int i : v[nod])
            {
                intrari[i] --;
            }

            for(int i = 1; i <= n; i ++)
            {
                if(intrari[i] <= 0 && visited[i] == 0)
                {
                    q.push(i);
                }
            }
        }
    }
}

int main()
{

    in >> n >> m;

    for(int i = 1; i <= m; i ++)
    {
        in >> x >> y;

        v[x].push_back(y);

        intrari[y] ++;
    }

    for(int i = 1; i <= n; i ++)
    {
        if(intrari[i] == 0)
        {
            q.push(i);
        }
    }

    tsort();

    return 0;
}