#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int N=50001;
int v[N];
vector<int>H[N];
vector<int>::iterator it;
queue<int>Q;
int main()
{
    int n,m,i,j,a,b;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        v[b]++;
        H[a].push_back(b);
    }
    for(i=1;i<=n;i++)
    {
        if(v[i]==0) Q.push(i);
    }
    while(Q.size())
    {
        a=Q.front();
        fout<<a<<" ";
        for(it=H[a].begin();it!=H[a].end();it++)
        {
            v[*it]--;
            if(v[*it]==0) Q.push(*it);
        }
        Q.pop();
    }
}