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

ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
queue<int> q;

bool vizi[50001];
int nr;
int timp;
vector<vector<int>> mat;

void dfs(int tat)
{
    vizi[tat]=1;
    for(vector<int>::iterator k=mat[tat].begin();k!=mat[tat].end();k++)
    {
        if(vizi[*k]==0)
            dfs(*k);
    }
    q.push(tat);
}

int main()
{
    int n,m;
    fin>>n>>m;
    int tat,fiu;
    mat.push_back(vector<int> ());
    for(int k=1;k<=n;k++)
        mat.push_back(vector<int> ());
    for(int k=1;k<=m;k++)
    {
        fin>>tat>>fiu;
        mat[tat].push_back(fiu);
    }
    for(int k=1;k<=n;k++)
    {
        if(vizi[k]==0)
        {
            dfs(k);
            while(!q.empty())
            {
                fout<<q.front()<<" ";
                q.pop();
            }
        }
    }
    return 0;
}