#include <bits/stdc++.h>
#define NN 100005
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");

int n, m, a, b;
vector <int> g[NN];
int gi[NN];
queue <int> q;


int main()
{
    fin >> n >> m;
    for(int i = 1 ; i <= m ; i++)
    {
        fin >> a >> b;
        gi[b]++;
        g[a].push_back(b);
    }
    for(int i = 1 ; i <= n ; i++)
    {
        if(gi[i] == 0)
            q.push(i);
    }
    while(!q.empty())
    {
        a = q.front();
        q.pop();
        fout << a << " ";
        for(int i = 0 ; i < g[a].size() ; i++)
        {
            b = g[a][i];
            if(gi[b] == 1)
                q.push(b);
            gi[b]--;
        }

    }
    return 0;
}