#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,k;

vector <int> v[50005];

int grad[50005];

int sol[50005];

queue <int> q;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;i++)
    {
        if(grad[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        int ac = q.front();
        q.pop();
        fout<<ac<<' ';
        for(int i=0;i<v[ac].size();i++)
        {
            int vec = v[ac][i];

            grad[vec]--;
            if(grad[vec]==0)
                q.push(vec);
        }
    }

}