#include <bits/stdc++.h>
using namespace std;
int a[100001], b[100001], part1[100001], part2[100001];
int main() {
  int n, m, c;
  cin >> n >> m >> c;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) cin >> b[i], part1[i] = part1[i - 1] + b[i];
  for (int i = 1; i <= m; i++) part2[i] = part2[i - 1] + b[m - i + 1];
  for (int i = 1; i <= n; i++) {
    if (i <= m) {
      a[i] = (a[i] +
              (i < n - m + 1 ? part1[i] : part1[i] - part1[i - (n - m + 1)])) %
             c;
    } else if (n - i + 1 <= m) {
      a[i] = (a[i] + part2[n - i + 1]) % c;
    } else
      a[i] = (a[i] + part1[m]) % c;
  }
  for (int i = 1; i <= n; i++) cout << a[i] << ' ';
  return 0;
}
