lazycipher

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n, q, indexA, indexI;

lazycipher

#include <sstream>
#include <vector>
#include <iostream>
using namespace std;

vector<int> parseInts(string str) {
	stringstream s(str);
    vector<int> arr;
    int a;
    char ch;

lazycipher

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    vector<int> ins;

lazycipher

''' In the first line integer n - the number of test cases (equal to about 1000).
Then n test cases follow. Each test case starts with the number of lines which is followed by their content. '''

n = int(input())
db = []

for i in range(n):
    lines = int(input())
    temp = []
    for j in range(lines):

lazycipher

#include <iostream>
#include <sstream>
using namespace std;

class Student{
    private:
    int age, standard;
    string first_name, last_name;
    
    public:

lazycipher

#include<bits/stdc++.h>

using namespace std;
 
class Box{
    private:
    int l, b, h;
    public:
    Box(){
        this->l = this->b = this->h = 0;

lazycipher

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    vector<int> ins;

lazycipher

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n,q;

lazycipher

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;


int main() {

lazycipher

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <set>
#include <map>
#include <algorithm>
#include<string>
using namespace std;