import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, M;
int[] A, B;

int[][] G;
bool[] vis;
int[] us;

void dfs(int u) {
  if (!vis[u]) {
    vis[u] = true;
    foreach (v; G[u]) {
      dfs(v);
    }
    us ~= u;
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      M += (N - 1);
      A = new int[M];
      B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
      }
      
      auto indeg = new int[N];
      foreach (i; 0 .. M) {
        ++indeg[B[i]];
      }
      // const rt = indeg.minIndex;
      int rt;
      foreach (u; 0 .. N) {
        if (indeg[rt] > indeg[u]) {
          rt = u;
        }
      }
      assert(indeg[rt] == 0);
      
      G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= B[i];
      }
      vis = new bool[N];
      us = [];
      dfs(rt);
      us.reverse();
      debug {
        writeln("us = ", us);
      }
      
      auto ord = new int[N];
      foreach (j; 0 .. N) {
        ord[us[j]] = j;
      }
      
      auto par = new int[N];
      par[] = -1;
      foreach (u; us) {
        foreach (v; G[u]) {
          if (ord[u] < ord[v]) {
            par[v] = u;
          }
        }
      }
      foreach (u; 0 .. N) {
        writeln(par[u] + 1);
      }
    }
  } catch (EOFException e) {
  }
}
