#include <cstdio>
# include <vector>
using namespace std;
#define DIM  500001 
vector <int> v[DIM];
int num,q[3*DIM],n,m;
bool viz[50010];

void sorttop(int nod)
{
    int i;
    viz[nod]=true;
    for (i=0; i<v[nod].size(); i++)
        if (viz[v[nod][i]]==false)
        {
            sorttop(v[nod][i]);
            q[++num]=v[nod][i];
        }
}

void read()
{
	int x,y;
	scanf("%d %d\n",&n,&m);
    for (int i=1; i<=m; i++)
    {
        scanf("%d %d\n",&x,&y);
        v[x].push_back(y);
    }
 
}


void solve()
{
    for (int i=1;i<=n;++i)
        if(viz[i]==false)
        {
            sorttop(i);
            q[++num]=i;
 
        }
}

void print()
{
	 for (int i=num;i>=1;i--)
        printf("%d ",q[i]);
    printf("\n");
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
	read();
    solve();
    print();
   
}