#include <fstream>
#include <vector>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <algorithm>

#define DIM 50001

using namespace std;

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

vector<int> l[DIM];
deque<int> c;
int n, m, x, y, viz[DIM], k;

// dfs
void dfs(int nod)
{
    viz[nod] = 1;
    for (int i = 0; i < l[nod].size(); i++)
    {
        if (viz[l[nod][i]] == 0)
        {
            dfs(l[nod][i]);
        }
    }
    c.push_back(nod);
}

int main()
{
    // reading
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        cin >> x >> y;
        l[x].push_back(y);
    }

    // algorithm
    for (k = 1; k <= n; k++)
    {
        if (viz[k] == 0)
        {
            dfs(k);
        }
    }

    // output
    while (!c.empty())
    {
        cout << c.back()<<" ";
        c.pop_back();
    }

}