#include <fstream>
#include <vector>

#define NMAX 50000

using namespace std;

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

vector <int> G[NMAX], v;
int n, m, i, x, y;
bool viz[NMAX];

void topSort(int nod)
{
    viz[nod] = 1;
    int nrvecini = G[nod].size();
    for (int i=0; i<nrvecini; i++)
    {
        int vecin = G[nod][i];
        if (!viz[vecin])
        {
            topSort(vecin);
            v.insert(v.begin(), vecin);
        }
    }
}

int main()
{
    fin >> n >> m;
    for (i=1; i<=m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }

    for (i=1; i<=n; i++)
        if (!viz[i])
            topSort(i);

    v.insert(v.begin(), 1);

    for (i=0; i<v.size(); i++)
        fout << v[i] << " ";


    return 0;
}