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

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

struct graf
{
    int act, grad;
};

graf v[505];
queue <int> q;

int main()
{
    int n,m,x,y;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].act=y;
        v[y].grad++;
    }

    for(int i=1; i<=n; i++)
    {
        if(v[i].grad==0)
        {
            q.push(i);
        }
    }

    while(!q.empty())
    {
        fout<<q.front()<<" ";
        for (int i=1; i<=v[q.front()].act; i++)
        {
            v[i].grad--;
            if (!v[i].grad)
            {
                q.push(i);
            }
        }
        q.pop();
    }

    fin.close();
    fout.close();
    return 0;
}