#include <iostream>
#include <stdlib.h>
#include <vector>

using namespace std;

vector<int> v[10001];
int Proc[1001];
bool Passed[1001];
bool Conf[1001];
int Levels[1001];
int maxLvl = -1;

void Process (int node, int level) {
    if (Passed[node] == false) {

        if (level >= Levels[node]) {
        Conf[node] = true;
        Passed[node] = true;
            Levels[node] = level;
        if (level > maxLvl)
            maxLvl = level;

        int len = v[node].size();
        for (int i = 0; i < len; i++)
            Process(v[node][i], level + 1);

        Passed[node] = false;
        }
    } else {
        cout << "-1";
        exit(0);
    }
}

int main () {
    int nodes, conn;
    cin >> nodes >> conn;

    for (int i = 0; i < conn; i++) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
    }

    for (int i = 1; i <= nodes; i++) {
        if (!Conf[i])
            Process(i, 0);
    }

    for (int i = 1; i <= nodes; i++)
        v[i].clear();

    for (int i = 1; i <= nodes; i++) {
        v[Levels[i]].push_back(i);
    }

    int index = 1;

    for (int i = 0; i <= maxLvl; i++) {
        int len = v[i].size();
        for (int k = 0; k < len; k++) {
            Proc[v[i][k]] = index++;
        }
    }

    for (int i = 1; i <= nodes; i++) {
        cout << Proc[i] << " ";
    }
}