#include <iostream>

#include <queue>

#include <algorithm>

#include <vector>

using namespace std;

int main()

{

	ios::sync_with_stdio(false);

	cin.tie(nullptr);

	cout.tie(nullptr);

	int c;

	cin >> c;

	while (c--) {

		int n, t, m, in;

		string side;

		pair<int, int> temp;

		queue< pair<int, int> > boatl, boatr;

		cin >> n >> t >> m;	

		for (size_t i = 0; i < m; ++i) {		

			cin >> temp.first >> side;

			temp.second = i;

			side == "left" ? boatl.emplace(temp) : boatr.emplace(temp);

		}

		int time = 0;

		auto cur = &boatl;

		vector<int> result(m);

		while (!boatl.empty() || !boatr.empty()) {

			if (boatr.empty()) {			

				time = max(time, boatl.front().first);

				if (*cur == boatr) time += t, cur = &boatl;

			}

			else if (boatl.empty()) {

				time = max(time, boatr.front().first);

				if (*cur == boatl) time += t, cur = &boatr;

			}

			else {

				auto small = (boatl.front().first < boatr.front().first) ? &boatl : &boatr;

				if (boatl.front().first == boatr.front().first) small = cur;

				if (time >= small->front().first) {

					if (small != cur && time < cur->front().first)

						time += t, cur = small;

				}

				else {

					time = small->front().first;

					if (small != cur) time += t, cur = small;				

				}

			}

			for (size_t i = 0; i < n && !cur->empty(); ++i)

				if (cur->front().first <= time) result[cur->front().second] = time + t, cur->pop();

			time += t;

			if (*cur == boatl) cur = &boatr;

			else cur = &boatl;

		}

		for (auto& i : result) cout << i << "\n";

		if(c) cout << "\n";

	}

	return 0;

}

#include <iostream>

#include <string>

#include <vector>

#include <algorithm>

#include <queue>

using namespace std;

typedef tuple<int, int, int> tp;

typedef pair<int, int> p;

int main()

{

	ios::sync_with_stdio(false);

	cin.tie(nullptr);

	cout.tie(nullptr);

	int T;

	cin >> T;

	while (T--)

	{

		int n, t, m;

		queue<p> Q[2];

		cin >> n >> t >> m;

		for (int i = 0; i < m; ++i)

		{

			int time;

			string side;

			cin >> time >> side;

			side == "left" ? Q[0].push({ time, i }) : Q[1].push({ time, i });

		}

		int cur = 0, time = 0;

		vector<int> ret(m);

		while (!Q[0].empty() || !Q[1].empty())

		{

			int close, cnt = 0;

			if (Q[0].empty()) close = Q[1].front().first;

			else if (Q[1].empty()) close = Q[0].front().first;

			else close = min(Q[1].front().first, Q[0].front().first);

			time = max(time, close);

			while (!Q[cur].empty() && cnt < n && Q[cur].front().first <= time)

			{

				ret[Q[cur].front().second] = time + t;

				Q[cur].pop();

				++cnt;

			}

			cur ^= 1;

			time += t;

		}

		for (auto& i : ret) cout << i << "\n";

		if (T) cout << "\n";

	}

}