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

#define NMax 50001

using namespace std;

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

int N,M;
vector<int> Graf[NMax];
bool v[NMax];
stack<int> Out;

void Read();

void DFS(int nod)
{
    v[nod]=true;
    for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
        if(!v[*it])
            DFS(*it);
    Out.push(nod);
}

int main()
{
    Read();
    for(int i=1;i<=N;i++)
        if(!v[i])
            DFS(i);
    while(!Out.empty())
        fout<<Out.top()<<" ", Out.pop();
    return 0;
}

void Read()
{
    fin>>N>>M;
    int x,y;
    for(int i=1;i<=M;i++)
    {
        fin>>x>>y;
        Graf[x].push_back(y);
    }
}