#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

const int NMAX = 50000 + 4;
vector <int> gr[NMAX], rez;
int n , m ;
bool vis[NMAX];

void topSort(int x)
{
    vis[x]=1;

    for(int i = 0; i < gr[x].size(); ++i)
    {
        if(vis[gr[x][i]] == 0)
            topSort(gr[x][i]);
    }

    rez.push_back(x);
}

int main()
{
    int a , b;
    fin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        fin >> a>> b;
        gr[a].push_back(b);
    }
    topSort(1);

    for (int i = 0; i < rez.size(); ++i) fout<<rez[i]<<" ";
    return 0;
}