#include <iostream>
#include <fstream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

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

vector<int> v[50005];
stack<int> S;
bool viz[100005];
int n,m;

void Read()
{
    int x,y;
    fin>>n>>m;
    for (int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
}
void DFS(int x)
{
    viz[x]=1;
    vector<int> :: iterator i;
    for(i=v[x].begin();i!=v[x].end();++i)
        if(viz[*i]!=1)
            DFS(*i);
    S.push(x);
}
void Sort()
{
    for(int i=1;i<=n;i++)
        if(viz[i]!=1)
            DFS(i);
    while(!S.empty())
    {
        fout<<S.top()<<" ";
        S.pop();
    }
}
int main()
{
    Read();
    Sort();
    return 0;
}