import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto A = new int[M];
      auto B = new int[M];
      auto K = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        K[i] = readInt() - 1;
      }
      
      auto heads = iota(N).array;
      auto befs = new int[N + M];
      befs[] = -1;
      auto graph = new int[][N + M];
      foreach (i; 0 .. M) {
        befs[N + i] = heads[A[i]];
        heads[A[i]] = N + i;
        graph[heads[B[i]]] ~= N + i;
      }
      auto on = new bool[N + M];
      foreach (j; 0 .. N) {
        on[heads[j]] = true;
      }
      
      auto dis = new int[N + M];
      auto fin = new int[N + M];
      int[] us;
      void dfs(int u) {
        dis[u] = cast(int)(us.length);
        if (on[u]) {
          us ~= u;
        }
        foreach_reverse (v; graph[u]) {
          dfs(v);
        }
        fin[u] = cast(int)(us.length);
      }
      
      foreach (j; 0 .. N) {
        dfs(j);
      }
      
      debug {
        writeln("us = ", us);
      }
      assert(us.length == N);
      foreach (i; 0 .. M) {
        const a = dis[N + i];
        const b = fin[N + i];
        const c = dis[befs[N + i]];
        debug {
          writefln("cut [%s, %s) and insert at %s", a, b, c);
        }
        alias Slice = Tuple!(int, "l", int, "r");
        Slice[] slices;
        if (c <= a) {
          slices ~= Slice(0, c);
          slices ~= Slice(a, b);
          slices ~= Slice(c, a);
          slices ~= Slice(b, N);
        } else if (b <= c) {
          slices ~= Slice(0, a);
          slices ~= Slice(b, c);
          slices ~= Slice(a, b);
          slices ~= Slice(c, N);
        } else {
          assert(false);
        }
        int ans = -1;
        int k = K[i];
        foreach (ref slice; slices) {
          const len = slice.r - slice.l;
          if (k < len) {
            const u = us[slice.l + k];
            ans = (u < N) ? u : A[u - N];
            break;
          } else {
            k -= len;
          }
        }
        assert(ans != -1);
        writeln(ans + 1);
      }
    }
  } catch (EOFException e) {
  }
}