#include <bits/stdc++.h>

using namespace std;

ifstream in("sortaret.in");
ofstream out("sortaret.out");

const int N = 5e4;

int viz[N + 1], fre[N + 1];

vector <int> graf[N + 1];

void dfs(int i)
{
    viz[i] = 1;
    for(int j = 0; j < graf[i].size(); j++)
    {
        if(!viz[graf[i][j]])
         {
             viz[graf[i][j]] = 1;
             dfs(graf[i][j]);
         }
    }
    out << i << ' ';
}

int main()
{
    int n, m, l, c;
    in >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        in >> l >> c;
        graf[c].push_back(l);
        fre[l]++;
    }
    for(int i = 1; i <= n; i++)
    {
        if(fre[i] == 0)
        {
            dfs(i);
        }
    }
    return 0;
}