#include <bits/stdc++.h>
using namespace std;
long long ap(long long a, long long d, long long n){
  return (2 * a + (n - 1) * d) * n / 2;
}
int get(int B, int M, int E, int t){
  int cnt = (B - M) / E + 1;
  long long T = ap(B * 2, -E * 2, cnt);
  if (t <= T){
    int tv = 0, fv = (B - M) / E + 1;
    while (fv - tv > 1){
      int mid = (tv + fv) / 2;
      if (ap(B * 2, -E * 2, mid) <= t){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    long long t2 = ap(B * 2, -E * 2, tv);
    t -= t2;
    if (tv % 2 == 0){
      int a = B - E * tv;
      if (t <= a){
        return t;
      } else {
        return a * 2 - t;
      }
    } else {
      int a = B - E * tv;
      if (t <= a){
        return -t;
      } else {
        return -(a * 2 - t);
      }
    }
  } else {
    t -= T;
    t %= M * 4;
    int ans;
    if (t < M){
      ans = t;
    } else if (t < M * 3){
      ans = M * 2 - t;
    } else {
      ans = t - M * 4;
    }
    if (cnt % 2 == 1){
      ans *= -1;
    }
    return ans;
  }
}
long long get_score(int N, int K, vector<int> &T, vector<int> &U, vector<int> &B, vector<int> &M, vector<int> &E){
  long long S1 = 0, S2 = 0;
  for (int i = 0; i < K; i++){
    vector<int> X(N);
    for (int j = 0; j < N; j++){
      X[j] = get(B[j], M[j], E[j], T[i]);
    }
    double ans = 0;
    for (int j = 0; j < N; j++){
      for (int k = j + 1; k < N; k++){
        ans += (double) abs(X[j] - X[k]) / (B[j] + B[k]);
      }
    }
    ans *= 20000000;
    ans /= N;
    ans /= N - 1;
    S1 += ans;
  }
  for (int i = 0; i < K; i++){
    vector<int> X(N);
    for (int j = 0; j < N; j++){
      X[j] = get(B[j], M[j], E[j], U[i]);
    }
    int mx = 0;
    for (int j = 0; j < N; j++){
      for (int k = j + 1; k < N; k++){
        mx = max(mx, abs(X[k] - X[j]));
      }
    }
    double ans = (double) mx / 20 + 1;
    ans = 10000000 / sqrt(ans);
    S2 += ans;
  }
  S1 /= K;
  S2 /= K;
  return S1 * S2;
}
void generate(int K, vector<int> &T, vector<int> &U){
  int D = 200;
  vector<int> G(K * 2 + 1);
  mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
  uniform_real_distribution<> dist(0.0, 1.0);
  while (true){
    vector<double> F(K * 2, 0);
    for (int i = 0; i < K * 2; i++){
      while (F[i] == 0){
        F[i] = dist(mt);
      }
    }
    G[0] = 0;
    bool ok = true;
    for (int i = 0; i < K * 2; i++){
      int c = D / F[i];
      if (G[i] + c > 1000000000){
        ok = false;
        break;
      }
      G[i + 1] = G[i] + c;
    }
    if (ok){
      break;
    }
  }
  T.resize(K);
  U.resize(K);
  for (int i = 0; i < K; i++){
    T[i] = G[i * 2 + 1];
    U[i] = G[i * 2 + 2];
  }
  if (mt() % 2 == 0){
    swap(T, U);
  }
}
void solve(int N, int K, vector<int> &T, vector<int> &U, vector<int> &B, vector<int> &M, vector<int> &E){
  long long mx = 0;
  mt19937 mt(0);
  for (int i = 0; i < 50; i++){
    vector<int> B2(N), M2(N), E2(N);
    for (int j = 0; j < N; j++){
      B2[j] = mt() % 10 + 1;
      M2[j] = mt() % B2[j] + 1;
      E2[j] = mt() % 3 + 1;
    }
    long long score = get_score(N, K, T, U, B2, M2, E2);
    if (score > mx){
      mx = score;
      B = B2;
      M = M2;
      E = E2;
    }
  }
}
long long test(int N, int K){
  long long ans = 0;
  for (int i = 0; i < 50; i++){
    vector<int> T, U;
    generate(K, T, U);
    vector<int> B, M, E;
    solve(N, K, T, U, B, M, E);
    ans += get_score(N,  K, T, U, B, M, E);
  }
  return ans;
}
int main(){
  //cout << test(50, 50) << endl;
  int N, K;
  cin >> N >> K;
  vector<int> T(N);
  for (int i = 0; i < N; i++){
    cin >> T[i];
  }
  vector<int> U(N);
  for (int i = 0; i < N; i++){
    cin >> U[i];
  }
  vector<int> B, M, E;
  solve(N, K, T, U, B, M, E);
  for (int i = 0; i < N; i++){
    cout << B[i] << ' ' << M[i] << ' ' << E[i] << endl;
  }
}