#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

#define maxn 50003

vector <int> g[maxn];
int n,m,grad[maxn],viz[maxn],i,j,k,x,y;

int main()
{
    fin>>n;
    fin>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
        grad[y]++;
    }
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            if (!viz[j] && grad[j]==0)
            {
                fout<<j<<" ";
                viz[j]=1;
                for (k=0;k<=g[j].size()-1;k++)
                {
                    grad[g[j][k]]--;
                }
                break;
            }
        }
    }
    fin.close();
    fout.close();
    return 0;
}