#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int MaxN = 50005;
int N, M;
vector<int> G[MaxN];
vector<int> S;
bool v[MaxN];

void Read();
void DFS(int x);

int main()
{
    Read();

    for(int i = 1; i <= N; ++i)
        if(!v[i])
            DFS(i);

    for(int i = S.size() - 1; i >= 0; i--)
        fout << S[i] << " ";

    fout.close();
    return 0;
}

void Read()
{
    fin >> N >> M;
    while(M--)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    fin.close();
}
void DFS(int x)
{
    v[x] = true;
    for(const int y : G[x])
        if(!v[y]) DFS(y);
    S.push_back(x);
}