#include <bits/stdc++.h>
using namespace std;
int nc, mc, c;
int n[100002];
int m[100002];
int cn[100002];
int Lowbit(int t) { return t & (t ^ (t - 1)); }
int Sum(int end) {
  int sum = 0;
  while (end > 0) {
    sum += cn[end];
    end -= Lowbit(end);
  }
  return sum;
}
int result(int j, int i) {
  int m1;
  int sum = 0;
  for (m1 = i; m1 <= j; m1++) {
    sum = sum + m[m1];
  }
  return sum;
}
void cinit(int pos) { cn[pos] = result(pos, pos - Lowbit(pos) + 1); }
int main() {
  memset(m, 0, m[0]);
  memset(n, 0, n[0]);
  memset(cn, 0, cn[0]);
  int i, j;
  scanf("%d%d%d", &nc, &mc, &c);
  for (i = 1; i <= nc; i++) {
    scanf("%I64d", &n[i]);
  }
  for (i = 1; i <= mc; i++) {
    scanf("%d", &m[i]);
    cinit(i);
  }
  if ((nc - mc + 1) >= (mc)) {
    for (i = 1; i <= mc; i++) {
      n[i] = n[i] + Sum(i);
    }
    for (i = mc + 1; i <= nc - mc + 1; i++) {
      n[i] = n[i] + Sum(mc);
    }
    for (i = nc - mc + 2, j = 1; i <= nc; i++, j++) {
      n[i] = n[i] + Sum(mc) - Sum(j);
    }
  } else {
    for (i = 1; i <= nc - mc + 1; i++) {
      n[i] = n[i] + Sum(i);
    }
    for (i = nc - mc + 2, j = 1; i <= mc; i++, j++) {
      n[i] = n[i] + Sum(i) - Sum(j);
    }
    for (i = mc + 1; i <= nc; i++, j++) {
      n[i] = n[i] + Sum(mc) - Sum(j);
    }
  }
  for (i = 1; i <= nc - 1; i++) {
    n[i] = n[i] % c;
    printf("%d ", n[i]);
  }
  printf("%d\n", n[nc] % c);
  return 0;
}
