#include <bits/stdc++.h>
using namespace std;

const int N = 1e3;
int n, m, a[N];

int main(int argc, char **argv) {
	int t;
	scanf("%d", &t);
	while (t-- != 0) {
		scanf("%d%d", &n, &m);
		for (int i = 0; i < n; ++i)
			scanf("%d", &a[i]);
		int at = -1;
		for (int i = 0; i < n; ++i)
			if (a[i] != -1) {
				at = i;
				break;
			}
		assert(at != -1);
		for (int i = at + 1; i < n; ++i)
			a[i] = (a[i - 1] + 1) % m;
		for (int i = at - 1; i >= 0; --i)
			a[i] = ((a[i + 1] - 1) % m + m) % m;
		for (int i = 0; i < n; ++i)
			printf("%s%d", i ? " " : "", a[i]);
		puts("");
	}
	return 0;
}