diff --git a/environments/code_gen/README.md b/environments/code_gen/README.md
new file mode 100644
index 000000000..1258f414c
--- /dev/null
+++ b/environments/code_gen/README.md
@@ -0,0 +1,39 @@
+# Competitive Coding Resources Server
+
+### Overview
+Verifies competitive programming solutions by executing submitted code against unit tests. The server consumes agent trajectories and returns a reward based on whether the assistant's code produces the correct outputs for given test inputs.
+
+The dataset is in preparation and the example data can be found in `data/example.jsonl`.
+
+### Input schema
+- `responses_create_params`: OpenAI Responses create params
+  - Use only a user message with the problem statement and instructions (e.g., "You are an expert competitive programmer...").
+  - `verifier_metadata` (required):
+    - `unit_tests` (required): dict with `inputs` and `outputs` arrays containing test cases.
+      - `inputs`: list of strings representing stdin input for each test case
+      - `outputs`: list of strings representing expected stdout output for each test case
+
+**Notes**
+- All test cases must pass for a solution to receive a reward of 1.0
+- Failed test cases result in a reward of 0.0 with detailed error information
+
+### Test execution (for now)
+We use the LiveCodeBench execution code.
+
+### Example of rollouts and usage
+
+```bash
+# Running the server
+config_paths="responses_api_models/openai_model/configs/openai_model.yaml,\
+environments/code_gen/config.yaml"
+ng_run "+config_paths=[$config_paths]"
+
+# Collect rollouts from example problems
+ng_collect_rollouts +agent_name=code_gen_simple_agent \
+    +input_jsonl_fpath=environments/code_gen/data/example.jsonl \
+    +output_jsonl_fpath=environments/code_gen/data/example_rollouts.jsonl \
+    +limit=null
+```
+
+## Licensing information
+Apache 2.0
diff --git a/environments/code_gen/__init__.py b/environments/code_gen/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/environments/code_gen/config.yaml b/environments/code_gen/config.yaml
new file mode 100644
index 000000000..f5f62eb17
--- /dev/null
+++ b/environments/code_gen/config.yaml
@@ -0,0 +1,42 @@
+code_gen:
+  resources_servers:
+    code_gen:
+      entrypoint: app.py
+      domain: coding
+      verified: true
+      verified_url: https://wandb.ai/nvidia/bxyu-nemo-gym-rl-integration-20250926/runs/54uzarwq
+      description: Model must submit the right code to solve a problem
+      value: Improve competitive coding capabilities
+      num_processes: 8
+      unit_test_timeout_secs: 10
+      debug: false
+code_gen_simple_agent:
+  responses_api_agents:
+    simple_agent:
+      entrypoint: app.py
+      resources_server:
+        type: resources_servers
+        name: code_gen
+      model_server:
+        type: responses_api_models
+        name: policy_model
+      datasets:
+      - name: opencodereasoning_filtered_train
+        type: train
+        jsonl_fpath: environments/code_gen/data/opencodereasoning_filtered_25k_train.jsonl
+        huggingface_identifier:
+          repo_id: nvidia/nemotron-RL-coding-competitive_coding
+          artifact_fpath: opencodereasoning_filtered_25k_train.jsonl
+        license: Apache 2.0
+        num_repeats: 1
+      - name: livecodebench_v5_validation
+        type: validation
+        jsonl_fpath: environments/code_gen/data/livecodebench_v5_2024-07-01_2025-02-01_validation.jsonl
+        huggingface_identifier:
+          repo_id: nvidia/nemotron-RL-coding-competitive_coding
+          artifact_fpath: validation.jsonl
+        license: MIT
+        num_repeats: 10  # Use livecodebench setting, even if sampling parameters differ.
+      - name: example
+        type: example
+        jsonl_fpath: environments/code_gen/data/example.jsonl
diff --git a/environments/code_gen/data/.gitignore b/environments/code_gen/data/.gitignore
new file mode 100644
index 000000000..4424b6fde
--- /dev/null
+++ b/environments/code_gen/data/.gitignore
@@ -0,0 +1,5 @@
+*train.jsonl
+*validation.jsonl
+*train_prepare.jsonl
+*validation_prepare.jsonl
+*example_prepare.jsonl
diff --git a/environments/code_gen/data/example.jsonl b/environments/code_gen/data/example.jsonl
new file mode 100644
index 000000000..2bab199f3
--- /dev/null
+++ b/environments/code_gen/data/example.jsonl
@@ -0,0 +1,5 @@
+{"responses_create_params": {"input": [{"role": "user", "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nPolycarp has $n$ different binary words. A word called binary if it contains only characters '0' and '1'. For example, these words are binary: \"0001\", \"11\", \"0\" and \"0011100\".\n\nPolycarp wants to offer his set of $n$ binary words to play a game \"words\". In this game, players name words and each next word (starting from the second) must start with the last character of the previous word. The first word can be any. For example, these sequence of words can be named during the game: \"0101\", \"1\", \"10\", \"00\", \"00001\".\n\nWord reversal is the operation of reversing the order of the characters. For example, the word \"0111\" after the reversal becomes \"1110\", the word \"11010\" after the reversal becomes \"01011\".\n\nProbably, Polycarp has such a set of words that there is no way to put them in the order correspondent to the game rules. In this situation, he wants to reverse some words from his set so that:  the final set of $n$ words still contains different words (i.e. all words are unique);  there is a way to put all words of the final set of words in the order so that the final sequence of $n$ words is consistent with the game rules. \n\nPolycarp wants to reverse minimal number of words. Please, help him.\n\n\n-----Input-----\n\nThe first line of the input contains one integer $t$ ($1 \\le t \\le 10^4$) \u2014 the number of test cases in the input. Then $t$ test cases follow.\n\nThe first line of a test case contains one integer $n$ ($1 \\le n \\le 2\\cdot10^5$) \u2014 the number of words in the Polycarp's set. Next $n$ lines contain these words. All of $n$ words aren't empty and contains only characters '0' and '1'. The sum of word lengths doesn't exceed $4\\cdot10^6$. All words are different.\n\nGuaranteed, that the sum of $n$ for all test cases in the input doesn't exceed $2\\cdot10^5$. Also, guaranteed that the sum of word lengths for all test cases in the input doesn't exceed $4\\cdot10^6$.\n\n\n-----Output-----\n\nPrint answer for all of $t$ test cases in the order they appear.\n\nIf there is no answer for the test case, print -1. Otherwise, the first line of the output should contain $k$ ($0 \\le k \\le n$) \u2014 the minimal number of words in the set which should be reversed. The second line of the output should contain $k$ distinct integers \u2014 the indexes of the words in the set which should be reversed. Words are numerated from $1$ to $n$ in the order they appear. If $k=0$ you can skip this line (or you can print an empty line). If there are many answers you can print any of them.\n\n\n-----Example-----\nInput\n4\n4\n0001\n1000\n0011\n0111\n3\n010\n101\n0\n2\n00000\n00001\n4\n01\n001\n0001\n00001\n\nOutput\n1\n3 \n-1\n0\n\n2\n1 2"}]}, "verifier_metadata": {"unit_tests": {"inputs": ["4\n4\n0001\n1000\n0011\n0111\n3\n010\n101\n0\n2\n00000\n00001\n4\n01\n001\n0001\n00001\n"], "outputs": ["1\n3 \n-1\n0\n\n2\n1 2 \n"]}}, "hash_id": "c69268d8bdb4da0685d7b187c88296c1", "dataset": "taco", "source": "codeforces"}
+{"responses_create_params": {"input": [{"role": "user", "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nMikhail walks on a Cartesian plane. He starts at the point $(0, 0)$, and in one move he can go to any of eight adjacent points. For example, if Mikhail is currently at the point $(0, 0)$, he can go to any of the following points in one move:   $(1, 0)$;  $(1, 1)$;  $(0, 1)$;  $(-1, 1)$;  $(-1, 0)$;  $(-1, -1)$;  $(0, -1)$;  $(1, -1)$. \n\nIf Mikhail goes from the point $(x1, y1)$ to the point $(x2, y2)$ in one move, and $x1 \\ne x2$ and $y1 \\ne y2$, then such a move is called a diagonal move.\n\nMikhail has $q$ queries. For the $i$-th query Mikhail's target is to go to the point $(n_i, m_i)$ from the point $(0, 0)$ in exactly $k_i$ moves. Among all possible movements he want to choose one with the maximum number of diagonal moves. Your task is to find the maximum number of diagonal moves or find that it is impossible to go from the point $(0, 0)$ to the point $(n_i, m_i)$ in $k_i$ moves.\n\nNote that Mikhail can visit any point any number of times (even the destination point!).\n\n\n-----Input-----\n\nThe first line of the input contains one integer $q$ ($1 \\le q \\le 10^4$) \u2014 the number of queries.\n\nThen $q$ lines follow. The $i$-th of these $q$ lines contains three integers $n_i$, $m_i$ and $k_i$ ($1 \\le n_i, m_i, k_i \\le 10^{18}$) \u2014 $x$-coordinate of the destination point of the query, $y$-coordinate of the destination point of the query and the number of moves in the query, correspondingly.\n\n\n-----Output-----\n\nPrint $q$ integers. The $i$-th integer should be equal to -1 if Mikhail cannot go from the point $(0, 0)$ to the point $(n_i, m_i)$ in exactly $k_i$ moves described above. Otherwise the $i$-th integer should be equal to the the maximum number of diagonal moves among all possible movements.\n\n\n-----Example-----\nInput\n3\n2 2 3\n4 3 7\n10 1 9\n\nOutput\n1\n6\n-1\n\n\n\n-----Note-----\n\nOne of the possible answers to the first test case: $(0, 0) \\to (1, 0) \\to (1, 1) \\to (2, 2)$.\n\nOne of the possible answers to the second test case: $(0, 0) \\to (0, 1) \\to (1, 2) \\to (0, 3) \\to (1, 4) \\to (2, 3) \\to (3, 2) \\to (4, 3)$.\n\nIn the third test case Mikhail cannot reach the point $(10, 1)$ in 9 moves."}]}, "verifier_metadata": {"unit_tests": {"inputs": ["3\n2 2 3\n4 3 7\n10 1 9\n", "3\n2 2 3\n4 3 7\n7 1 9\n", "3\n2 2 3\n4 3 9\n7 1 9\n", "3\n2 2 3\n6 1 9\n7 1 1\n", "3\n2 1 3\n6 1 9\n7 0 2\n", "3\n2 0 3\n3 1 9\n13 0 2\n", "3\n4 0 3\n3 1 9\n13 0 2\n", "3\n7 0 0\n3 1 5\n22 0 2\n", "3\n1 0 0\n5 0 5\n22 0 2\n", "3\n1 0 1\n5 0 5\n22 0 2\n", "3\n1 0 1\n9 0 5\n35 0 1\n", "3\n2 2 3\n4 3 6\n10 1 9\n", "3\n4 2 3\n4 3 7\n7 1 9\n", "3\n2 2 3\n6 3 9\n7 2 9\n", "3\n2 2 3\n6 3 9\n7 1 12\n", "3\n3 2 3\n6 1 9\n7 1 9\n", "3\n2 2 3\n6 1 12\n7 1 1\n", "3\n2 2 3\n6 2 9\n7 0 1\n", "3\n5 0 3\n3 2 9\n13 0 2\n", "3\n7 0 0\n3 1 0\n22 0 2\n", "3\n1 0 1\n5 1 5\n22 0 3\n", "3\n1 1 1\n9 -1 5\n35 0 1\n", "3\n4 2 3\n4 3 7\n4 1 9\n", "3\n2 2 1\n6 3 9\n7 2 9\n", "3\n2 2 3\n1 3 9\n7 1 12\n", "3\n3 2 1\n6 1 9\n7 1 9\n", "3\n2 0 4\n6 1 9\n7 0 2\n", "3\n2 1 3\n6 2 9\n25 0 2\n", "3\n1 1 0\n3 1 3\n22 0 2\n", "3\n2 2 1\n1 3 9\n7 1 12\n", "3\n2 2 3\n6 2 18\n10 0 1\n", "3\n2 1 0\n6 2 9\n25 0 2\n", "3\n2 2 3\n6 3 9\n7 1 9\n", "3\n2 2 3\n6 1 9\n7 1 9\n", "3\n2 2 3\n6 1 9\n7 0 1\n", "3\n2 2 3\n6 1 9\n7 0 2\n", "3\n2 1 3\n6 1 9\n13 0 2\n", "3\n2 0 3\n6 1 9\n13 0 2\n", "3\n5 0 3\n3 1 9\n13 0 2\n", "3\n5 0 0\n3 1 9\n13 0 2\n", "3\n5 0 0\n3 1 9\n22 0 2\n", "3\n7 0 0\n3 1 9\n22 0 2\n", "3\n1 0 0\n3 1 5\n22 0 2\n", "3\n1 0 0\n5 1 5\n22 0 2\n", "3\n1 0 0\n5 0 5\n22 0 1\n", "3\n1 0 0\n5 0 5\n22 1 1\n", "3\n1 0 1\n5 0 5\n22 0 3\n", "3\n1 0 1\n5 0 5\n22 0 1\n", "3\n1 0 1\n5 0 5\n35 0 1\n", "3\n1 0 1\n9 -1 5\n35 0 1\n", "3\n1 0 1\n9 0 5\n35 -1 1\n", "3\n2 0 3\n6 1 9\n7 0 2\n", "3\n2 1 3\n6 1 9\n10 0 2\n", "3\n2 1 3\n6 1 9\n25 0 2\n", "3\n2 0 3\n6 1 9\n13 -1 2\n", "3\n2 0 1\n3 1 9\n13 0 2\n", "3\n4 0 3\n1 1 9\n13 0 2\n", "3\n5 0 0\n3 1 9\n13 0 0\n", "3\n5 -1 0\n3 1 9\n22 0 2\n", "3\n1 1 0\n3 1 5\n22 0 2\n", "3\n1 0 0\n5 1 5\n38 0 2\n", "3\n1 0 0\n5 0 5\n22 0 0\n", "3\n1 0 0\n5 0 5\n22 2 1\n", "3\n1 0 1\n5 0 5\n22 1 1\n", "3\n1 0 1\n9 0 5\n15 0 1\n", "3\n1 0 1\n9 0 5\n35 -1 0\n", "3\n2 0 3\n4 3 6\n10 1 9\n", "3\n2 2 3\n6 1 12\n5 1 1\n", "3\n2 2 3\n6 2 9\n10 0 1\n", "3\n2 2 3\n6 1 9\n10 0 2\n", "3\n3 0 3\n6 1 9\n13 0 2\n", "3\n2 0 1\n3 1 9\n20 0 2\n", "3\n4 0 3\n1 1 9\n13 0 1\n", "3\n5 0 3\n3 2 9\n13 0 3\n", "3\n5 0 0\n5 1 9\n13 0 0\n", "3\n3 -1 0\n3 1 9\n22 0 2\n", "3\n7 0 0\n3 1 1\n22 0 2\n", "3\n1 0 0\n5 1 5\n38 0 3\n", "3\n1 0 0\n5 0 5\n22 2 0\n", "3\n1 0 1\n5 1 5\n17 0 3\n", "3\n1 0 1\n5 1 5\n22 1 1\n", "3\n1 0 1\n9 0 0\n15 0 1\n", "3\n1 1 1\n9 0 5\n35 0 1\n", "3\n1 0 1\n9 0 5\n52 -1 0\n", "3\n2 0 3\n7 3 6\n10 1 9\n", "3\n4 2 3\n4 1 7\n4 1 9\n", "3\n2 2 1\n4 3 9\n7 2 9\n", "3\n3 2 1\n6 1 9\n7 1 2\n", "3\n2 2 3\n6 1 12\n9 1 1\n", "3\n2 0 0\n6 1 9\n7 0 2\n", "3\n2 2 3\n6 2 9\n10 0 2\n", "3\n2 0 3\n1 1 9\n13 0 2\n", "3\n2 0 1\n3 0 9\n20 0 2\n", "3\n4 0 1\n1 1 9\n13 0 1\n", "3\n5 0 3\n3 2 9\n13 0 4\n", "3\n5 0 0\n5 1 9\n22 0 0\n", "3\n2 2 3\n4 3 7\n10 1 9\n"], "outputs": ["1\n6\n-1\n", "1\n6\n9\n", "1\n8\n9\n", "1\n8\n-1\n", "2\n8\n-1\n", "1\n9\n-1\n", "-1\n9\n-1\n", "-1\n5\n-1\n", "-1\n4\n-1\n", "0\n4\n-1\n", "0\n-1\n-1\n", "1\n5\n-1\n", "-1\n6\n9\n", "1\n8\n8\n", "1\n8\n10\n", "2\n8\n9\n", "1\n11\n-1\n", "1\n7\n-1\n", "-1\n8\n-1\n", "-1\n-1\n-1\n", "0\n5\n-1\n", "1\n-1\n-1\n", "-1\n6\n8\n", "-1\n8\n8\n", "1\n9\n10\n", "-1\n8\n9\n", "4\n8\n-1\n", "2\n7\n-1\n", "-1\n3\n-1\n", "-1\n9\n10\n", "1\n18\n-1\n", "-1\n7\n-1\n", "1\n8\n9\n", "1\n8\n9\n", "1\n8\n-1\n", "1\n8\n-1\n", "2\n8\n-1\n", "1\n8\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n5\n-1\n", "-1\n5\n-1\n", "-1\n4\n-1\n", "-1\n4\n-1\n", "0\n4\n-1\n", "0\n4\n-1\n", "0\n4\n-1\n", "0\n-1\n-1\n", "0\n-1\n-1\n", "1\n8\n-1\n", "2\n8\n-1\n", "2\n8\n-1\n", "1\n8\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n5\n-1\n", "-1\n5\n-1\n", "-1\n4\n-1\n", "-1\n4\n-1\n", "0\n4\n-1\n", "0\n-1\n-1\n", "0\n-1\n-1\n", "1\n5\n-1\n", "1\n11\n-1\n", "1\n7\n-1\n", "1\n8\n-1\n", "2\n8\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n8\n-1\n", "-1\n9\n-1\n", "-1\n9\n-1\n", "-1\n-1\n-1\n", "-1\n5\n-1\n", "-1\n4\n-1\n", "0\n5\n-1\n", "0\n5\n-1\n", "0\n-1\n-1\n", "1\n-1\n-1\n", "0\n-1\n-1\n", "1\n-1\n-1\n", "-1\n6\n8\n", "-1\n8\n8\n", "-1\n8\n-1\n", "1\n11\n-1\n", "-1\n8\n-1\n", "1\n7\n-1\n", "1\n9\n-1\n", "-1\n8\n-1\n", "-1\n9\n-1\n", "-1\n8\n-1\n", "-1\n9\n-1\n", "1\n6\n-1\n"]}}, "hash_id": "570676e22bd21c28e452486b0668ec74", "dataset": "taco", "source": "codeforces"}
+{"responses_create_params": {"input": [{"role": "user", "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou are given three sequences: $a_1, a_2, \\ldots, a_n$; $b_1, b_2, \\ldots, b_n$; $c_1, c_2, \\ldots, c_n$.\n\nFor each $i$, $a_i \\neq b_i$, $a_i \\neq c_i$, $b_i \\neq c_i$.\n\nFind a sequence $p_1, p_2, \\ldots, p_n$, that satisfy the following conditions:\n\n\n\n $p_i \\in \\{a_i, b_i, c_i\\}$\n\n $p_i \\neq p_{(i \\mod n) + 1}$.\n\nIn other words, for each element, you need to choose one of the three possible values, such that no two adjacent elements (where we consider elements $i,i+1$ adjacent for $i<n$ and also elements $1$ and $n$) will have equal value.\n\nIt can be proved that in the given constraints solution always exists. You don't need to minimize/maximize anything, you need to find any proper sequence.\n\n\n-----Input-----\n\nThe first line of input contains one integer $t$ ($1 \\leq t \\leq 100$): the number of test cases.\n\nThe first line of each test case contains one integer $n$ ($3 \\leq n \\leq 100$): the number of elements in the given sequences.\n\nThe second line contains $n$ integers $a_1, a_2, \\ldots, a_n$ ($1 \\leq a_i \\leq 100$).\n\nThe third line contains $n$ integers $b_1, b_2, \\ldots, b_n$ ($1 \\leq b_i \\leq 100$).\n\nThe fourth line contains $n$ integers $c_1, c_2, \\ldots, c_n$ ($1 \\leq c_i \\leq 100$).\n\nIt is guaranteed that $a_i \\neq b_i$, $a_i \\neq c_i$, $b_i \\neq c_i$ for all $i$.\n\n\n-----Output-----\n\nFor each test case, print $n$ integers: $p_1, p_2, \\ldots, p_n$ ($p_i \\in \\{a_i, b_i, c_i\\}$, $p_i \\neq p_{i \\mod n + 1}$).\n\nIf there are several solutions, you can print any.\n\n\n-----Example-----\nInput\n5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n\nOutput\n1 2 3\n1 2 1 2\n1 3 4 3 2 4 2\n1 3 2\n1 2 3 1 2 3 1 2 3 2\n\n\n\n-----Note-----\n\nIn the first test case $p = [1, 2, 3]$.\n\nIt is a correct answer, because:\n\n  $p_1 = 1 = a_1$, $p_2 = 2 = b_2$, $p_3 = 3 = c_3$  $p_1 \\neq p_2 $, $p_2 \\neq p_3 $, $p_3 \\neq p_1$ \n\nAll possible correct answers to this test case are: $[1, 2, 3]$, $[1, 3, 2]$, $[2, 1, 3]$, $[2, 3, 1]$, $[3, 1, 2]$, $[3, 2, 1]$.\n\nIn the second test case $p = [1, 2, 1, 2]$.\n\nIn this sequence $p_1 = a_1$, $p_2 = a_2$, $p_3 = a_3$, $p_4 = a_4$. Also we can see, that no two adjacent elements of the sequence are equal.\n\nIn the third test case $p = [1, 3, 4, 3, 2, 4, 2]$.\n\nIn this sequence $p_1 = a_1$, $p_2 = a_2$, $p_3 = b_3$, $p_4 = b_4$, $p_5 = b_5$, $p_6 = c_6$, $p_7 = c_7$. Also we can see, that no two adjacent elements of the sequence are equal."}]}, "verifier_metadata": {"unit_tests": {"inputs": ["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 2\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 2 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 4 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 3 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 2\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 5 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 0\n7\n2 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 6 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 0\n7\n2 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 1 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 4 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 6 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n2 1 1 2 2 2 3 3 3 1\n2 2 2 6 3 3 1 1 1 2\n3 3 5 1 1 1 2 3 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 0 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 5 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 4\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 1 4 3 2 2 4\n5 3 2 4 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n3 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 4 3\n4\n2 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 5 4 3 2 2 4\n4 3 3 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 4 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 0 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 3 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 5 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 4 2 4\n5 3 2 2 7 4 2\n3\n1 2 1\n0 3 4\n3 1 2\n10\n2 1 1 2 2 4 6 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 4\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 1 4 3 2 2 4\n5 4 2 4 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 1 3 3 3 1\n3 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 4 2 4\n5 3 2 2 7 4 2\n3\n1 2 1\n0 3 8\n3 1 2\n10\n2 1 1 2 2 4 6 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 4\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 1 4 3 2 2 4\n5 4 2 4 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 1 3 3 3 1\n3 2 2 3 3 3 1 2 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 4 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 6\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 8 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 3 2 4\n4 2 2 2 4 4 2\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n4 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 2 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 3 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 2\n4 2 2 2 4 4 2\n3\n1 2 1\n2 6 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 5 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 1\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n4 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 5 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n4 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 6 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 3 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 5 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 1\n4 2 2 2 4 4 2\n3\n1 2 1\n2 6 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 2 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 5 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n3 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 1\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 2\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n6 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n3 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 0\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 2 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 2 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n4 3 3\n2 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 5 1 1 1 2 3 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 5 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 4 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 2 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 0 5 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n3 2 2\n3 3 3\n4\n1 2 1 2\n0 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 1\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n6 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 1 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 4 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n3 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 2 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 2 3 1 1 2 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 3\n3\n1 2 1\n4 3 3\n2 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 6 3 3 1 1 1 2\n3 3 5 1 1 1 2 3 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 5 4 3 2 2 4\n4 3 3 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 4 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 0 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n3 2 2\n3 3 3\n4\n1 2 1 2\n0 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 1\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 2 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 2\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 5 3 1\n2 2 2 3 3 3 1 1 1 2\n2 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n6 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n1 3 2 2 4 4 2\n3\n1 2 1\n0 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 1 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 1 4 3 2 2 4\n5 3 2 4 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n3 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 4 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 5 4 3 2 2 4\n4 3 3 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 4 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 2\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 2\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 5 3 1\n2 2 2 3 3 3 1 1 1 2\n2 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n4 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 0\n7\n2 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 1 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 4 2 4\n5 3 2 2 7 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 6 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 4\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 1 4 3 2 2 4\n5 4 2 4 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n3 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 4 3\n4\n2 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 5 4 3 2 2 4\n4 3 1 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 4 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 0 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 2 2 2 4\n4 3 2 2 4 4 2\n3\n1 3 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 5 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 0 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 2 2 2 4\n4 3 2 2 4 4 2\n3\n1 3 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 5 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 6 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 0 2 1\n3 4 3 4\n7\n1 3 4 1 1 1 1\n2 4 4 2 2 2 4\n4 3 2 2 4 4 2\n3\n1 3 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 5 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 6 1 1 1 2 2 4 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 1 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 4\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 2\n4 2 0 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 1 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 3 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 0 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 0 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 2\n4 2 2 2 4 4 2\n3\n1 2 1\n2 6 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 0 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n2 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 5 3 2 2 4\n4 2 2 2 4 4 1\n3\n1 2 2\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 2 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 1 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n1 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 4 3\n", "5\n3\n1 1 1\n2 2 2\n3 1 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 3 3 3 1\n2 4 2 3 3 3 1 1 1 2\n3 3 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n5 3 2 2 4 4 2\n3\n1 2 1\n0 3 6\n3 1 2\n10\n2 1 1 2 2 4 6 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 4 0 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 2 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 2 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 5 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 2 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 3\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 3 2 2 4 4 2\n3\n1 2 1\n4 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 4 1 1 1 2 2 2 3\n", "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n"], "outputs": ["1 2 3\n1 2 1 2\n1 3 4 1 2 1 4\n1 2 3\n1 2 1 2 3 2 3 1 3 2\n", "1 2 3\n1 2 1 2\n1 3 4 1 2 1 4\n1 2 3\n1 2 1 2 3 2 3 1 3 2\n", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 2 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 4 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 5 3 2 ", "1 2 3 1 2 1 2 2 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 6 3 1 3 ", "1 2 3 1 2 1 2 2 3 4 1 2 1 4 1 2 6 2 1 2 3 1 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 4 1 4 1 2 6 2 1 2 3 2 4 6 3 1 3 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 2 1 2 6 2 3 1 3 1 3 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 5 3 1 2 ", "1 2 3 1 2 1 4 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 2 1 2 1 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 3 2 1 2 1 2 3 4 5 3 1 2 ", "1 2 3 1 2 1 2 1 3 4 1 4 1 4 1 2 4 2 1 2 3 2 4 6 3 1 3 ", "1 2 3 1 2 1 4 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 1 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 4 1 4 1 2 8 2 1 2 3 2 4 6 3 1 3 ", "1 2 3 1 2 1 4 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 1 3 2 3 2 ", "1 2 3 1 4 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 6 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 8 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 3 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 2 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 2 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 2 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 5 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 5 3 2 ", "1 2 3 1 2 1 2 2 3 4 1 2 1 4 1 2 6 2 1 2 3 1 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 4 1 4 1 2 6 2 1 2 3 2 4 6 3 1 3 ", "1 2 3 1 2 1 4 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 2 1 2 1 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 3 2 1 2 1 2 3 4 5 3 1 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 3 2 1 2 1 2 3 4 5 3 1 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 3 2 1 2 1 2 3 4 5 3 1 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 2 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 2 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 2 1 2 1 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 5 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 3 1 3 1 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 6 2 1 2 3 2 4 6 3 1 3 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 2 3 1 3 2 ", "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3 1 2 1 3 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "1 2 3\n1 2 1 2\n1 3 4 1 2 1 4\n1 2 3\n1 2 1 2 3 2 3 1 3 2\n"]}}, "hash_id": "ff86821ed6f7260c7a17c4c9be03b663", "dataset": "taco", "source": "codeforces"}
+{"responses_create_params": {"input": [{"role": "user", "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou have $n$ barrels lined up in a row, numbered from left to right from one. Initially, the $i$-th barrel contains $a_i$ liters of water.\n\nYou can pour water from one barrel to another. In one act of pouring, you can choose two different barrels $x$ and $y$ (the $x$-th barrel shouldn't be empty) and pour any possible amount of water from barrel $x$ to barrel $y$ (possibly, all water). You may assume that barrels have infinite capacity, so you can pour any amount of water in each of them. \n\nCalculate the maximum possible difference between the maximum and the minimum amount of water in the barrels, if you can pour water at most $k$ times.\n\nSome examples:   if you have four barrels, each containing $5$ liters of water, and $k = 1$, you may pour $5$ liters from the second barrel into the fourth, so the amounts of water in the barrels are $[5, 0, 5, 10]$, and the difference between the maximum and the minimum is $10$;  if all barrels are empty, you can't make any operation, so the difference between the maximum and the minimum amount is still $0$. \n\n\n-----Input-----\n\nThe first line contains one integer $t$ ($1 \\le t \\le 1000$)\u00a0\u2014 the number of test cases.\n\nThe first line of each test case contains two integers $n$ and $k$ ($1 \\le k < n \\le 2 \\cdot 10^5$)\u00a0\u2014 the number of barrels and the number of pourings you can make.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^{9}$), where $a_i$ is the initial amount of water the $i$-th barrel has.\n\nIt's guaranteed that the total sum of $n$ over test cases doesn't exceed $2 \\cdot 10^5$.\n\n\n-----Output-----\n\nFor each test case, print the maximum possible difference between the maximum and the minimum amount of water in the barrels, if you can pour water at most $k$ times.\n\n\n-----Example-----\nInput\n2\n4 1\n5 5 5 5\n3 2\n0 0 0\n\nOutput\n10\n0"}]}, "verifier_metadata": {"unit_tests": {"inputs": ["2\n4 1\n5 5 5 5\n3 2\n0 0 0\n", "2\n4 2\n5 5 5 5\n3 2\n0 0 0\n", "2\n4 2\n5 5 5 5\n3 2\n0 0 1\n", "2\n4 3\n5 5 2 5\n3 2\n0 1 0\n", "2\n4 3\n5 5 2 1\n3 2\n0 1 0\n", "2\n4 3\n5 1 2 1\n3 2\n0 1 0\n", "2\n4 2\n2 5 5 0\n3 2\n0 0 0\n", "2\n4 3\n5 1 2 2\n3 2\n0 1 0\n", "2\n4 3\n5 1 2 2\n3 2\n0 1 1\n", "2\n4 3\n5 1 2 2\n3 2\n0 1 2\n", "2\n4 1\n5 9 5 5\n3 2\n0 0 0\n", "2\n4 3\n5 5 2 5\n3 2\n0 2 0\n", "2\n4 3\n5 1 1 2\n3 2\n0 1 1\n", "2\n4 2\n5 2 9 5\n3 2\n0 0 1\n", "2\n4 1\n5 9 5 5\n3 1\n0 0 1\n", "2\n4 1\n19 5 2 5\n3 2\n0 0 1\n", "2\n4 3\n5 1 1 6\n3 1\n0 1 1\n", "2\n4 1\n5 16 5 5\n3 2\n0 0 1\n", "2\n4 2\n5 5 5 5\n3 2\n0 1 1\n", "2\n4 3\n5 5 2 1\n3 2\n0 0 0\n", "2\n4 3\n5 1 3 2\n3 2\n0 1 2\n", "2\n4 3\n5 5 3 5\n3 2\n0 2 0\n", "2\n4 1\n5 5 2 7\n3 2\n0 0 1\n", "2\n4 3\n10 1 1 2\n3 2\n0 1 1\n", "2\n4 3\n5 0 1 6\n3 1\n0 1 1\n", "2\n4 1\n5 16 5 5\n3 2\n0 0 2\n", "2\n4 3\n5 1 2 0\n3 1\n0 1 0\n", "2\n4 3\n8 1 3 2\n3 2\n0 1 2\n", "2\n4 2\n5 1 9 5\n3 2\n1 0 1\n", "2\n4 1\n5 11 5 5\n3 1\n1 0 1\n", "2\n4 3\n8 1 3 2\n3 2\n1 1 2\n", "2\n4 2\n19 4 0 5\n3 2\n0 0 1\n", "2\n4 2\n19 3 0 5\n3 2\n0 0 1\n", "2\n4 3\n5 5 2 8\n3 2\n0 1 0\n", "2\n4 3\n2 1 2 2\n3 2\n0 1 1\n", "2\n4 3\n5 1 2 2\n3 2\n0 2 2\n", "2\n4 3\n5 1 1 2\n3 2\n0 2 1\n", "2\n4 1\n5 5 5 5\n3 1\n0 0 0\n", "2\n4 1\n38 5 2 5\n3 2\n0 0 1\n", "2\n4 1\n5 24 5 5\n3 2\n0 0 1\n", "2\n4 2\n5 5 5 6\n3 2\n0 1 0\n", "2\n4 3\n5 1 4 1\n3 1\n0 1 0\n", "2\n4 2\n5 5 2 5\n3 2\n0 0 0\n", "2\n4 2\n5 5 2 5\n3 2\n0 1 0\n", "2\n4 2\n5 5 5 0\n3 2\n0 0 0\n", "2\n4 2\n5 5 2 5\n3 2\n0 0 1\n", "2\n4 2\n5 2 5 5\n3 2\n0 0 1\n", "2\n4 1\n5 5 2 5\n3 2\n0 0 1\n", "2\n4 1\n5 9 5 5\n3 1\n0 0 0\n", "2\n4 1\n10 5 2 5\n3 2\n0 0 1\n", "2\n4 3\n5 1 1 2\n3 1\n0 1 1\n", "2\n4 1\n5 2 9 5\n3 2\n0 0 1\n", "2\n4 3\n5 1 1 3\n3 1\n0 1 1\n", "2\n4 1\n5 9 5 5\n3 2\n0 0 1\n", "2\n4 2\n5 5 5 5\n3 2\n0 1 0\n", "2\n4 2\n9 5 2 5\n3 2\n0 1 0\n", "2\n4 3\n5 1 2 1\n3 1\n0 1 0\n", "2\n4 3\n5 1 2 1\n3 2\n0 1 1\n", "2\n4 1\n5 9 5 5\n3 1\n1 0 0\n", "2\n4 2\n5 1 9 5\n3 2\n0 0 1\n", "2\n4 1\n5 9 5 5\n3 1\n1 0 1\n", "2\n4 1\n5 2 9 8\n3 2\n0 0 1\n", "2\n4 1\n19 5 1 5\n3 2\n0 0 1\n", "2\n4 3\n5 1 1 3\n3 1\n0 1 0\n", "2\n4 3\n5 1 2 0\n3 2\n0 1 0\n", "2\n4 3\n5 5 0 5\n3 2\n0 2 0\n", "2\n4 1\n5 12 5 5\n3 1\n1 0 0\n", "2\n4 1\n19 5 0 5\n3 2\n0 0 1\n", "2\n4 3\n5 0 1 6\n3 1\n0 0 1\n", "2\n4 3\n5 1 4 0\n3 1\n0 1 0\n", "2\n4 1\n5 12 0 5\n3 1\n1 0 0\n", "2\n4 1\n19 4 0 5\n3 2\n0 0 1\n", "2\n4 3\n5 0 1 6\n3 1\n0 0 2\n", "2\n4 3\n5 5 2 1\n3 2\n1 1 0\n", "2\n4 2\n5 0 5 5\n3 2\n0 0 1\n", "2\n4 3\n5 5 2 5\n3 1\n0 2 0\n", "2\n4 1\n5 5 2 5\n3 2\n0 0 2\n", "2\n4 1\n2 5 2 5\n3 2\n0 0 1\n", "2\n4 3\n2 1 1 6\n3 1\n0 1 1\n", "2\n4 2\n5 5 6 6\n3 2\n0 1 0\n", "2\n4 3\n5 1 2 1\n3 1\n0 1 1\n", "2\n4 1\n5 5 5 5\n3 2\n0 0 0\n"], "outputs": ["10\n0\n", "15\n0\n", "15\n1\n", "17\n1\n", "13\n1\n", "9\n1\n", "12\n0\n", "10\n1\n", "10\n2\n", "10\n3\n", "14\n0\n", "17\n2\n", "9\n2\n", "19\n1\n", "14\n1\n", "24\n1\n", "13\n2\n", "21\n1\n", "15\n2\n", "13\n0\n", "11\n3\n", "18\n2\n", "12\n1\n", "14\n2\n", "12\n2\n", "21\n2\n", "8\n1\n", "14\n3\n", "19\n2\n", "16\n2\n", "14\n4\n", "28\n1\n", "27\n1\n", "20\n1\n", "7\n2\n", "10\n4\n", "9\n3\n", "10\n0\n", "43\n1\n", "29\n1\n", "16\n1\n", "11\n1\n", "15\n0\n", "15\n1\n", "15\n0\n", "15\n1\n", "15\n1\n", "10\n1\n", "14\n0\n", "15\n1\n", "9\n2\n", "14\n1\n", "10\n2\n", "14\n1\n", "15\n1\n", "19\n1\n", "9\n1\n", "9\n2\n", "14\n1\n", "19\n1\n", "14\n2\n", "17\n1\n", "24\n1\n", "10\n1\n", "8\n1\n", "15\n2\n", "17\n1\n", "24\n1\n", "12\n1\n", "10\n1\n", "17\n1\n", "24\n1\n", "12\n2\n", "13\n2\n", "15\n1\n", "17\n2\n", "10\n2\n", "10\n1\n", "10\n2\n", "17\n1\n", "9\n2\n", "10\n0\n"]}}, "hash_id": "f3e3b9f12d602bf80fdcd2c08a2f417f", "dataset": "taco", "source": "codeforces"}
+{"responses_create_params": {"input": [{"role": "user", "content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou are given a permutation $p=[p_1, p_2, \\ldots, p_n]$ of integers from $1$ to $n$. Let's call the number $m$ ($1 \\le m \\le n$) beautiful, if there exists two indices $l, r$ ($1 \\le l \\le r \\le n$), such that the numbers $[p_l, p_{l+1}, \\ldots, p_r]$ is a permutation of numbers $1, 2, \\ldots, m$.\n\nFor example, let $p = [4, 5, 1, 3, 2, 6]$. In this case, the numbers $1, 3, 5, 6$ are beautiful and $2, 4$ are not. It is because:  if $l = 3$ and $r = 3$ we will have a permutation $[1]$ for $m = 1$;  if $l = 3$ and $r = 5$ we will have a permutation $[1, 3, 2]$ for $m = 3$;  if $l = 1$ and $r = 5$ we will have a permutation $[4, 5, 1, 3, 2]$ for $m = 5$;  if $l = 1$ and $r = 6$ we will have a permutation $[4, 5, 1, 3, 2, 6]$ for $m = 6$;  it is impossible to take some $l$ and $r$, such that $[p_l, p_{l+1}, \\ldots, p_r]$ is a permutation of numbers $1, 2, \\ldots, m$ for $m = 2$ and for $m = 4$. \n\nYou are given a permutation $p=[p_1, p_2, \\ldots, p_n]$. For all $m$ ($1 \\le m \\le n$) determine if it is a beautiful number or not.\n\n\n-----Input-----\n\nThe first line contains the only integer $t$ ($1 \\le t \\le 1000$) \u00a0\u2014 the number of test cases in the input. The next lines contain the description of test cases.\n\nThe first line of a test case contains a number $n$ ($1 \\le n \\le 2 \\cdot 10^5$)\u00a0\u2014 the length of the given permutation $p$. The next line contains $n$ integers $p_1, p_2, \\ldots, p_n$ ($1 \\le p_i \\le n$, all $p_i$ are different)\u00a0\u2014 the given permutation $p$.\n\nIt is guaranteed, that the sum of $n$ from all test cases in the input doesn't exceed $2 \\cdot 10^5$.\n\n\n-----Output-----\n\nPrint $t$ lines\u00a0\u2014 the answers to test cases in the order they are given in the input. \n\nThe answer to a test case is the string of length $n$, there the $i$-th character is equal to $1$ if $i$ is a beautiful number and is equal to $0$ if $i$ is not a beautiful number.\n\n\n-----Example-----\nInput\n3\n6\n4 5 1 3 2 6\n5\n5 3 1 2 4\n4\n1 4 3 2\n\nOutput\n101011\n11111\n1001\n\n\n\n-----Note-----\n\nThe first test case is described in the problem statement.\n\nIn the second test case all numbers from $1$ to $5$ are beautiful:  if $l = 3$ and $r = 3$ we will have a permutation $[1]$ for $m = 1$;  if $l = 3$ and $r = 4$ we will have a permutation $[1, 2]$ for $m = 2$;  if $l = 2$ and $r = 4$ we will have a permutation $[3, 1, 2]$ for $m = 3$;  if $l = 2$ and $r = 5$ we will have a permutation $[3, 1, 2, 4]$ for $m = 4$;  if $l = 1$ and $r = 5$ we will have a permutation $[5, 3, 1, 2, 4]$ for $m = 5$."}]}, "verifier_metadata": {"unit_tests": {"inputs": ["3\n6\n4 5 1 3 2 6\n5\n5 3 1 2 4\n4\n1 4 3 2\n", "3\n6\n4 5 1 3 2 6\n5\n5 3 2 1 4\n4\n1 4 3 2\n", "3\n6\n4 5 1 3 2 6\n5\n5 3 1 2 4\n4\n1 4 3 2\n"], "outputs": ["101011\n11111\n1001\n", "101011\n11111\n1001\n", "101011\n11111\n1001\n"]}}, "hash_id": "1a54a91d7294e33bed666e3bc94148fd", "dataset": "taco", "source": "codeforces"}
diff --git a/environments/code_gen/data/example_metrics.json b/environments/code_gen/data/example_metrics.json
new file mode 100644
index 000000000..c0d5718a6
--- /dev/null
+++ b/environments/code_gen/data/example_metrics.json
@@ -0,0 +1,49 @@
+{
+    "name": "example",
+    "type": "example",
+    "jsonl_fpath": "resources_servers/code_gen/data/example.jsonl",
+    "num_repeats": 1,
+    "gitlab_identifier": null,
+    "license": null,
+    "Number of examples": 5,
+    "Number of tools": {
+        "Total # non-null values": 0,
+        "Average": 0.0,
+        "Min": 0.0,
+        "Max": 0.0,
+        "Standard deviation": 0.0
+    },
+    "Json-dumped number of words (proxy for token count)": {
+        "Total # non-null values": 5,
+        "Average": 468.0,
+        "Min": 359.0,
+        "Max": 553.0,
+        "Standard deviation": 79.76
+    },
+    "Number of turns": {
+        "Total # non-null values": 5,
+        "Average": 1.0,
+        "Min": 1.0,
+        "Max": 1.0,
+        "Standard deviation": 0.0
+    },
+    "Temperature": {
+        "Total # non-null values": 0,
+        "Average": 0.0,
+        "Min": 0.0,
+        "Max": 0.0,
+        "Standard deviation": 0.0
+    },
+    "hash_id": {
+        "unique_count": 5,
+        "total_count": 5
+    },
+    "dataset": {
+        "unique_count": 1,
+        "total_count": 5
+    },
+    "source": {
+        "unique_count": 1,
+        "total_count": 5
+    }
+}
\ No newline at end of file
diff --git a/environments/code_gen/data/example_rollouts.jsonl b/environments/code_gen/data/example_rollouts.jsonl
new file mode 100644
index 000000000..ddcc88ee9
--- /dev/null
+++ b/environments/code_gen/data/example_rollouts.jsonl
@@ -0,0 +1,5 @@
+{"responses_create_params": {"background": null, "include": null, "input": [{"content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou are given a permutation $p=[p_1, p_2, \\ldots, p_n]$ of integers from $1$ to $n$. Let's call the number $m$ ($1 \\le m \\le n$) beautiful, if there exists two indices $l, r$ ($1 \\le l \\le r \\le n$), such that the numbers $[p_l, p_{l+1}, \\ldots, p_r]$ is a permutation of numbers $1, 2, \\ldots, m$.\n\nFor example, let $p = [4, 5, 1, 3, 2, 6]$. In this case, the numbers $1, 3, 5, 6$ are beautiful and $2, 4$ are not. It is because:  if $l = 3$ and $r = 3$ we will have a permutation $[1]$ for $m = 1$;  if $l = 3$ and $r = 5$ we will have a permutation $[1, 3, 2]$ for $m = 3$;  if $l = 1$ and $r = 5$ we will have a permutation $[4, 5, 1, 3, 2]$ for $m = 5$;  if $l = 1$ and $r = 6$ we will have a permutation $[4, 5, 1, 3, 2, 6]$ for $m = 6$;  it is impossible to take some $l$ and $r$, such that $[p_l, p_{l+1}, \\ldots, p_r]$ is a permutation of numbers $1, 2, \\ldots, m$ for $m = 2$ and for $m = 4$. \n\nYou are given a permutation $p=[p_1, p_2, \\ldots, p_n]$. For all $m$ ($1 \\le m \\le n$) determine if it is a beautiful number or not.\n\n\n-----Input-----\n\nThe first line contains the only integer $t$ ($1 \\le t \\le 1000$) \u00a0\u2014 the number of test cases in the input. The next lines contain the description of test cases.\n\nThe first line of a test case contains a number $n$ ($1 \\le n \\le 2 \\cdot 10^5$)\u00a0\u2014 the length of the given permutation $p$. The next line contains $n$ integers $p_1, p_2, \\ldots, p_n$ ($1 \\le p_i \\le n$, all $p_i$ are different)\u00a0\u2014 the given permutation $p$.\n\nIt is guaranteed, that the sum of $n$ from all test cases in the input doesn't exceed $2 \\cdot 10^5$.\n\n\n-----Output-----\n\nPrint $t$ lines\u00a0\u2014 the answers to test cases in the order they are given in the input. \n\nThe answer to a test case is the string of length $n$, there the $i$-th character is equal to $1$ if $i$ is a beautiful number and is equal to $0$ if $i$ is not a beautiful number.\n\n\n-----Example-----\nInput\n3\n6\n4 5 1 3 2 6\n5\n5 3 1 2 4\n4\n1 4 3 2\n\nOutput\n101011\n11111\n1001\n\n\n\n-----Note-----\n\nThe first test case is described in the problem statement.\n\nIn the second test case all numbers from $1$ to $5$ are beautiful:  if $l = 3$ and $r = 3$ we will have a permutation $[1]$ for $m = 1$;  if $l = 3$ and $r = 4$ we will have a permutation $[1, 2]$ for $m = 2$;  if $l = 2$ and $r = 4$ we will have a permutation $[3, 1, 2]$ for $m = 3$;  if $l = 2$ and $r = 5$ we will have a permutation $[3, 1, 2, 4]$ for $m = 4$;  if $l = 1$ and $r = 5$ we will have a permutation $[5, 3, 1, 2, 4]$ for $m = 5$.", "role": "user", "type": "message"}], "instructions": null, "max_output_tokens": null, "max_tool_calls": null, "metadata": null, "model": null, "parallel_tool_calls": true, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "store": null, "temperature": null, "text": null, "tool_choice": "auto", "tools": [], "top_logprobs": null, "top_p": null, "truncation": null, "user": null, "stream": null}, "response": {"id": "resp_cd319ab895874e32aab3b55c9305a8d4", "created_at": 1758933021.0, "error": null, "incomplete_details": null, "instructions": null, "metadata": null, "model": "gpt-4.1-2025-04-14", "object": "response", "output": [{"id": "msg_95a668846a25466395603e70d55f3f4a", "content": [{"annotations": [], "text": "```python\n# Your code here\ndef solve():\n    import sys\n    input = sys.stdin.readline\n    t = int(input())\n    results = []\n    for _ in range(t):\n        n = int(input())\n        p = list(map(int, input().split()))\n        pos = [0]*(n+1)\n        for i, val in enumerate(p):\n            pos[val] = i\n        l = r = pos[1]\n        ans = ['1']\n        for m in range(2, n+1):\n            l = min(l, pos[m])\n            r = max(r, pos[m])\n            if r - l + 1 == m:\n                ans.append('1')\n            else:\n                ans.append('0')\n        results.append(\"\".join(ans))\n    print('\\n'.join(results))\n```", "type": "output_text", "logprobs": null}], "role": "assistant", "status": "completed", "type": "message"}], "parallel_tool_calls": true, "temperature": null, "tool_choice": "auto", "tools": [], "top_p": null, "background": null, "max_output_tokens": null, "max_tool_calls": null, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "status": null, "text": null, "top_logprobs": null, "truncation": null, "usage": null, "user": null}, "reward": 0.0, "extracted_model_output": "```python\n# Your code here\ndef solve():\n    import sys\n    input = sys.stdin.readline\n    t = int(input())\n    results = []\n    for _ in range(t):\n        n = int(input())\n        p = list(map(int, input().split()))\n        pos = [0]*(n+1)\n        for i, val in enumerate(p):\n            pos[val] = i\n        l = r = pos[1]\n        ans = ['1']\n        for m in range(2, n+1):\n            l = min(l, pos[m])\n            r = max(r, pos[m])\n            if r - l + 1 == m:\n                ans.append('1')\n            else:\n                ans.append('0')\n        results.append(\"\".join(ans))\n    print('\\n'.join(results))\n```", "extracted_model_code": "# Your code here\ndef solve():\n    import sys\n    input = sys.stdin.readline\n    t = int(input())\n    results = []\n    for _ in range(t):\n        n = int(input())\n        p = list(map(int, input().split()))\n        pos = [0]*(n+1)\n        for i, val in enumerate(p):\n            pos[val] = i\n        l = r = pos[1]\n        ans = ['1']\n        for m in range(2, n+1):\n            l = min(l, pos[m])\n            r = max(r, pos[m])\n            if r - l + 1 == m:\n                ans.append('1')\n            else:\n                ans.append('0')\n        results.append(\"\".join(ans))\n    print('\\n'.join(results))", "result": [-2], "metadata": {"output": "", "inputs": "3\n6\n4 5 1 3 2 6\n5\n5 3 1 2 4\n4\n1 4 3 2\n", "expected": "101011\n11111\n1001\n", "error_code": -2, "error_message": "Wrong answer: mismatched output length"}}
+{"responses_create_params": {"background": null, "include": null, "input": [{"content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou have $n$ barrels lined up in a row, numbered from left to right from one. Initially, the $i$-th barrel contains $a_i$ liters of water.\n\nYou can pour water from one barrel to another. In one act of pouring, you can choose two different barrels $x$ and $y$ (the $x$-th barrel shouldn't be empty) and pour any possible amount of water from barrel $x$ to barrel $y$ (possibly, all water). You may assume that barrels have infinite capacity, so you can pour any amount of water in each of them. \n\nCalculate the maximum possible difference between the maximum and the minimum amount of water in the barrels, if you can pour water at most $k$ times.\n\nSome examples:   if you have four barrels, each containing $5$ liters of water, and $k = 1$, you may pour $5$ liters from the second barrel into the fourth, so the amounts of water in the barrels are $[5, 0, 5, 10]$, and the difference between the maximum and the minimum is $10$;  if all barrels are empty, you can't make any operation, so the difference between the maximum and the minimum amount is still $0$. \n\n\n-----Input-----\n\nThe first line contains one integer $t$ ($1 \\le t \\le 1000$)\u00a0\u2014 the number of test cases.\n\nThe first line of each test case contains two integers $n$ and $k$ ($1 \\le k < n \\le 2 \\cdot 10^5$)\u00a0\u2014 the number of barrels and the number of pourings you can make.\n\nThe second line contains $n$ integers $a_1, a_2, \\dots, a_n$ ($0 \\le a_i \\le 10^{9}$), where $a_i$ is the initial amount of water the $i$-th barrel has.\n\nIt's guaranteed that the total sum of $n$ over test cases doesn't exceed $2 \\cdot 10^5$.\n\n\n-----Output-----\n\nFor each test case, print the maximum possible difference between the maximum and the minimum amount of water in the barrels, if you can pour water at most $k$ times.\n\n\n-----Example-----\nInput\n2\n4 1\n5 5 5 5\n3 2\n0 0 0\n\nOutput\n10\n0", "role": "user", "type": "message"}], "instructions": null, "max_output_tokens": null, "max_tool_calls": null, "metadata": null, "model": null, "parallel_tool_calls": true, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "store": null, "temperature": null, "text": null, "tool_choice": "auto", "tools": [], "top_logprobs": null, "top_p": null, "truncation": null, "user": null, "stream": null}, "response": {"id": "resp_92e90a11fa5e48d4b6553749b2e75c74", "created_at": 1758933021.0, "error": null, "incomplete_details": null, "instructions": null, "metadata": null, "model": "gpt-4.1-2025-04-14", "object": "response", "output": [{"id": "msg_7aa3dfc3ef8b490fbcd2d1607176ed94", "content": [{"annotations": [], "text": "```python\n# Your code here\ndef max_water_difference(test_cases):\n    results = []\n    for n, k, a in test_cases:\n        a.sort(reverse=True)\n        max_water = a[0] + sum(a[1:k+1])\n        min_water = 0  # After pouring, some barrel(s) could be 0\n        results.append(max_water - min_water)\n    return results\n\n# Read input and print output as per the format\nt = int(input())\ntest_cases = []\nfor _ in range(t):\n    n, k = map(int, input().split())\n    a = list(map(int, input().split()))\n    test_cases.append((n, k, a))\n\nresults = max_water_difference(test_cases)\nfor res in results:\n    print(res)\n```", "type": "output_text", "logprobs": null}], "role": "assistant", "status": "completed", "type": "message"}], "parallel_tool_calls": true, "temperature": null, "tool_choice": "auto", "tools": [], "top_p": null, "background": null, "max_output_tokens": null, "max_tool_calls": null, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "status": null, "text": null, "top_logprobs": null, "truncation": null, "usage": null, "user": null}, "reward": 1.0, "extracted_model_output": "```python\n# Your code here\ndef max_water_difference(test_cases):\n    results = []\n    for n, k, a in test_cases:\n        a.sort(reverse=True)\n        max_water = a[0] + sum(a[1:k+1])\n        min_water = 0  # After pouring, some barrel(s) could be 0\n        results.append(max_water - min_water)\n    return results\n\n# Read input and print output as per the format\nt = int(input())\ntest_cases = []\nfor _ in range(t):\n    n, k = map(int, input().split())\n    a = list(map(int, input().split()))\n    test_cases.append((n, k, a))\n\nresults = max_water_difference(test_cases)\nfor res in results:\n    print(res)\n```", "extracted_model_code": "# Your code here\ndef max_water_difference(test_cases):\n    results = []\n    for n, k, a in test_cases:\n        a.sort(reverse=True)\n        max_water = a[0] + sum(a[1:k+1])\n        min_water = 0  # After pouring, some barrel(s) could be 0\n        results.append(max_water - min_water)\n    return results\n\n# Read input and print output as per the format\nt = int(input())\ntest_cases = []\nfor _ in range(t):\n    n, k = map(int, input().split())\n    a = list(map(int, input().split()))\n    test_cases.append((n, k, a))\n\nresults = max_water_difference(test_cases)\nfor res in results:\n    print(res)", "result": [true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true], "metadata": {"execution time": 0.06142306327819824}}
+{"responses_create_params": {"background": null, "include": null, "input": [{"content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nYou are given three sequences: $a_1, a_2, \\ldots, a_n$; $b_1, b_2, \\ldots, b_n$; $c_1, c_2, \\ldots, c_n$.\n\nFor each $i$, $a_i \\neq b_i$, $a_i \\neq c_i$, $b_i \\neq c_i$.\n\nFind a sequence $p_1, p_2, \\ldots, p_n$, that satisfy the following conditions:\n\n\n\n $p_i \\in \\{a_i, b_i, c_i\\}$\n\n $p_i \\neq p_{(i \\mod n) + 1}$.\n\nIn other words, for each element, you need to choose one of the three possible values, such that no two adjacent elements (where we consider elements $i,i+1$ adjacent for $i<n$ and also elements $1$ and $n$) will have equal value.\n\nIt can be proved that in the given constraints solution always exists. You don't need to minimize/maximize anything, you need to find any proper sequence.\n\n\n-----Input-----\n\nThe first line of input contains one integer $t$ ($1 \\leq t \\leq 100$): the number of test cases.\n\nThe first line of each test case contains one integer $n$ ($3 \\leq n \\leq 100$): the number of elements in the given sequences.\n\nThe second line contains $n$ integers $a_1, a_2, \\ldots, a_n$ ($1 \\leq a_i \\leq 100$).\n\nThe third line contains $n$ integers $b_1, b_2, \\ldots, b_n$ ($1 \\leq b_i \\leq 100$).\n\nThe fourth line contains $n$ integers $c_1, c_2, \\ldots, c_n$ ($1 \\leq c_i \\leq 100$).\n\nIt is guaranteed that $a_i \\neq b_i$, $a_i \\neq c_i$, $b_i \\neq c_i$ for all $i$.\n\n\n-----Output-----\n\nFor each test case, print $n$ integers: $p_1, p_2, \\ldots, p_n$ ($p_i \\in \\{a_i, b_i, c_i\\}$, $p_i \\neq p_{i \\mod n + 1}$).\n\nIf there are several solutions, you can print any.\n\n\n-----Example-----\nInput\n5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 2 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n\nOutput\n1 2 3\n1 2 1 2\n1 3 4 3 2 4 2\n1 3 2\n1 2 3 1 2 3 1 2 3 2\n\n\n\n-----Note-----\n\nIn the first test case $p = [1, 2, 3]$.\n\nIt is a correct answer, because:\n\n  $p_1 = 1 = a_1$, $p_2 = 2 = b_2$, $p_3 = 3 = c_3$  $p_1 \\neq p_2 $, $p_2 \\neq p_3 $, $p_3 \\neq p_1$ \n\nAll possible correct answers to this test case are: $[1, 2, 3]$, $[1, 3, 2]$, $[2, 1, 3]$, $[2, 3, 1]$, $[3, 1, 2]$, $[3, 2, 1]$.\n\nIn the second test case $p = [1, 2, 1, 2]$.\n\nIn this sequence $p_1 = a_1$, $p_2 = a_2$, $p_3 = a_3$, $p_4 = a_4$. Also we can see, that no two adjacent elements of the sequence are equal.\n\nIn the third test case $p = [1, 3, 4, 3, 2, 4, 2]$.\n\nIn this sequence $p_1 = a_1$, $p_2 = a_2$, $p_3 = b_3$, $p_4 = b_4$, $p_5 = b_5$, $p_6 = c_6$, $p_7 = c_7$. Also we can see, that no two adjacent elements of the sequence are equal.", "role": "user", "type": "message"}], "instructions": null, "max_output_tokens": null, "max_tool_calls": null, "metadata": null, "model": null, "parallel_tool_calls": true, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "store": null, "temperature": null, "text": null, "tool_choice": "auto", "tools": [], "top_logprobs": null, "top_p": null, "truncation": null, "user": null, "stream": null}, "response": {"id": "resp_1a072f4980354640accdddba5c0ceb22", "created_at": 1758933022.0, "error": null, "incomplete_details": null, "instructions": null, "metadata": null, "model": "gpt-4.1-2025-04-14", "object": "response", "output": [{"id": "msg_08f9787cdfe843239740d8ab8520eb59", "content": [{"annotations": [], "text": "```python\n# Your code here\nt = int(input())\nfor _ in range(t):\n    n = int(input())\n    a = list(map(int, input().split()))\n    b = list(map(int, input().split()))\n    c = list(map(int, input().split()))\n    p = [a[0]]\n    for i in range(1, n-1):\n        for op in (a[i], b[i], c[i]):\n            if op != p[-1]:\n                p.append(op)\n                break\n    # p[n-1], last element, must be different from both p[-1] and p[0]\n    for op in (a[n-1], b[n-1], c[n-1]):\n        if op != p[-1] and op != p[0]:\n            p.append(op)\n            break\n    print(' '.join(map(str, p)))\n```", "type": "output_text", "logprobs": null}], "role": "assistant", "status": "completed", "type": "message"}], "parallel_tool_calls": true, "temperature": null, "tool_choice": "auto", "tools": [], "top_p": null, "background": null, "max_output_tokens": null, "max_tool_calls": null, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "status": null, "text": null, "top_logprobs": null, "truncation": null, "usage": null, "user": null}, "reward": 0.0, "extracted_model_output": "```python\n# Your code here\nt = int(input())\nfor _ in range(t):\n    n = int(input())\n    a = list(map(int, input().split()))\n    b = list(map(int, input().split()))\n    c = list(map(int, input().split()))\n    p = [a[0]]\n    for i in range(1, n-1):\n        for op in (a[i], b[i], c[i]):\n            if op != p[-1]:\n                p.append(op)\n                break\n    # p[n-1], last element, must be different from both p[-1] and p[0]\n    for op in (a[n-1], b[n-1], c[n-1]):\n        if op != p[-1] and op != p[0]:\n            p.append(op)\n            break\n    print(' '.join(map(str, p)))\n```", "extracted_model_code": "# Your code here\nt = int(input())\nfor _ in range(t):\n    n = int(input())\n    a = list(map(int, input().split()))\n    b = list(map(int, input().split()))\n    c = list(map(int, input().split()))\n    p = [a[0]]\n    for i in range(1, n-1):\n        for op in (a[i], b[i], c[i]):\n            if op != p[-1]:\n                p.append(op)\n                break\n    # p[n-1], last element, must be different from both p[-1] and p[0]\n    for op in (a[n-1], b[n-1], c[n-1]):\n        if op != p[-1] and op != p[0]:\n            p.append(op)\n            break\n    print(' '.join(map(str, p)))", "result": [true, true, -2], "metadata": {"output": "1 2 3\n1 2 1 2\n1 3 4 1 2 1 4\n1 2 3\n1 2 1 2 3 4 3 1 3 2\n", "inputs": "5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\n4 2 2 2 4 4 2\n3\n1 2 1\n2 3 3\n3 1 2\n10\n1 1 1 2 2 4 3 3 3 1\n2 2 2 3 3 3 1 1 1 2\n3 3 3 1 1 1 2 2 2 3\n", "expected": "1 2 3 1 2 1 2 1 3 4 1 2 1 4 1 2 3 1 2 1 2 3 4 3 1 3 2 ", "error_code": -2, "error_message": "Wrong answer: mismatched output length"}}
+{"responses_create_params": {"background": null, "include": null, "input": [{"content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nMikhail walks on a Cartesian plane. He starts at the point $(0, 0)$, and in one move he can go to any of eight adjacent points. For example, if Mikhail is currently at the point $(0, 0)$, he can go to any of the following points in one move:   $(1, 0)$;  $(1, 1)$;  $(0, 1)$;  $(-1, 1)$;  $(-1, 0)$;  $(-1, -1)$;  $(0, -1)$;  $(1, -1)$. \n\nIf Mikhail goes from the point $(x1, y1)$ to the point $(x2, y2)$ in one move, and $x1 \\ne x2$ and $y1 \\ne y2$, then such a move is called a diagonal move.\n\nMikhail has $q$ queries. For the $i$-th query Mikhail's target is to go to the point $(n_i, m_i)$ from the point $(0, 0)$ in exactly $k_i$ moves. Among all possible movements he want to choose one with the maximum number of diagonal moves. Your task is to find the maximum number of diagonal moves or find that it is impossible to go from the point $(0, 0)$ to the point $(n_i, m_i)$ in $k_i$ moves.\n\nNote that Mikhail can visit any point any number of times (even the destination point!).\n\n\n-----Input-----\n\nThe first line of the input contains one integer $q$ ($1 \\le q \\le 10^4$) \u2014 the number of queries.\n\nThen $q$ lines follow. The $i$-th of these $q$ lines contains three integers $n_i$, $m_i$ and $k_i$ ($1 \\le n_i, m_i, k_i \\le 10^{18}$) \u2014 $x$-coordinate of the destination point of the query, $y$-coordinate of the destination point of the query and the number of moves in the query, correspondingly.\n\n\n-----Output-----\n\nPrint $q$ integers. The $i$-th integer should be equal to -1 if Mikhail cannot go from the point $(0, 0)$ to the point $(n_i, m_i)$ in exactly $k_i$ moves described above. Otherwise the $i$-th integer should be equal to the the maximum number of diagonal moves among all possible movements.\n\n\n-----Example-----\nInput\n3\n2 2 3\n4 3 7\n10 1 9\n\nOutput\n1\n6\n-1\n\n\n\n-----Note-----\n\nOne of the possible answers to the first test case: $(0, 0) \\to (1, 0) \\to (1, 1) \\to (2, 2)$.\n\nOne of the possible answers to the second test case: $(0, 0) \\to (0, 1) \\to (1, 2) \\to (0, 3) \\to (1, 4) \\to (2, 3) \\to (3, 2) \\to (4, 3)$.\n\nIn the third test case Mikhail cannot reach the point $(10, 1)$ in 9 moves.", "role": "user", "type": "message"}], "instructions": null, "max_output_tokens": null, "max_tool_calls": null, "metadata": null, "model": null, "parallel_tool_calls": true, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "store": null, "temperature": null, "text": null, "tool_choice": "auto", "tools": [], "top_logprobs": null, "top_p": null, "truncation": null, "user": null, "stream": null}, "response": {"id": "resp_e618c1fcde91445eab7593754f17fe11", "created_at": 1758933032.0, "error": null, "incomplete_details": null, "instructions": null, "metadata": null, "model": "gpt-4.1-2025-04-14", "object": "response", "output": [{"id": "msg_6043bbef2efc4412bc919dab916f1f6b", "content": [{"annotations": [], "text": "Let's break down the problem step by step:\n\n### Step-by-step Approach\n\n- **Diagonal Moves:** Each move can be diagonal if $x$ and $y$ both change. So, in one diagonal move, both coordinates change by $\\pm1$.\n- **Minimum Moves Needed:** To reach $(n, m)$ from $(0, 0)$, the minimal number of moves is $\\max(n, m)$, using as many diagonal moves as possible, then only horizontal or vertical moves for the remainder.\n- **Extra Moves:** If $k > \\max(n, m)$, Mikhail must take some \"detours\" (i.e., possibly moving back and forth to waste moves).\n- **Parity Check:** He can only make a detour move if the extra moves to be wasted can be arranged such that he ends up back at the destination. In this 8-way grid, he can move back and forth without changing the end position, but after all moves, the parity of $n + m$ and $k$ must match (otherwise, you can't waste just one move and land still at $(n,m)$).\n- **Maximum Diagonal Moves:** As many as possible, i.e., $\\min(n, m)$. However, with extra moves, unless there's some restriction, he could potentially waste them.\n\n#### Implementation Plan\n\nFor each query:\n1. Compute $min\\_moves = \\max(n, m)$.\n2. If $k < min\\_moves$ \u2192 impossible, answer $-1$.\n3. Check parity: if $(k - min\\_moves) \\% 2 != 0$ \u2192 impossible, answer $-1$.\n4. The maximal number of diagonal moves is $\\min(n, m)$. For any extra moves: if both $n$, $m$ are even/odd, you can use all moves as diagonal or detour without issue; otherwise, as long as the parity works, that's enough.\n\n#### Example:\n\nFor $(10, 1, 9)$:\n- $min\\_moves = 10$\n- $k = 9 < 10$ \u2192 Impossible\n\nFor $(2, 2, 3)$:\n- $min\\_moves = 2$\n- $k = 3 \\geq 2$\n- $(k - min\\_moves) = 1$, which is odd, so this is okay since both $n$, $m$ are even. But since he needs to land back at the destination, parity with $k$ must match $n+m$.\n\nLets formalize the check:\n\n*If $(k - \\max(n,m)) \\% 2 \\equiv (n + m) \\% 2$, then possible, else impossible.*\n\nBut actually, in 8-way moves, it's sufficient to check $(k - \\max(n, m))$ is even.\n\nLet's observe the general rule for 8-sided moves:\n\nIt **is always possible** if $k \\geq \\max(n, m)$ and $(k-\\max(n,m))$ is even.\n\n---\n\nNow, let's put this together in the final code as requested.\n\n```python\n# Your code here\nq = int(input())\nresults = []\nfor _ in range(q):\n    n, m, k = map(int, input().split())\n    min_moves = max(n, m)\n    # Check if it is possible\n    if k < min_moves:\n        results.append(-1)\n    elif (k - min_moves) % 2 != 0:\n        results.append(-1)\n    else:\n        # maximal diagonals is min(n, m)\n        results.append(k)\nprint('\\n'.join(map(str, results)))\n```", "type": "output_text", "logprobs": null}], "role": "assistant", "status": "completed", "type": "message"}], "parallel_tool_calls": true, "temperature": null, "tool_choice": "auto", "tools": [], "top_p": null, "background": null, "max_output_tokens": null, "max_tool_calls": null, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "status": null, "text": null, "top_logprobs": null, "truncation": null, "usage": null, "user": null}, "reward": 0.0, "extracted_model_output": "Let's break down the problem step by step:\n\n### Step-by-step Approach\n\n- **Diagonal Moves:** Each move can be diagonal if $x$ and $y$ both change. So, in one diagonal move, both coordinates change by $\\pm1$.\n- **Minimum Moves Needed:** To reach $(n, m)$ from $(0, 0)$, the minimal number of moves is $\\max(n, m)$, using as many diagonal moves as possible, then only horizontal or vertical moves for the remainder.\n- **Extra Moves:** If $k > \\max(n, m)$, Mikhail must take some \"detours\" (i.e., possibly moving back and forth to waste moves).\n- **Parity Check:** He can only make a detour move if the extra moves to be wasted can be arranged such that he ends up back at the destination. In this 8-way grid, he can move back and forth without changing the end position, but after all moves, the parity of $n + m$ and $k$ must match (otherwise, you can't waste just one move and land still at $(n,m)$).\n- **Maximum Diagonal Moves:** As many as possible, i.e., $\\min(n, m)$. However, with extra moves, unless there's some restriction, he could potentially waste them.\n\n#### Implementation Plan\n\nFor each query:\n1. Compute $min\\_moves = \\max(n, m)$.\n2. If $k < min\\_moves$ \u2192 impossible, answer $-1$.\n3. Check parity: if $(k - min\\_moves) \\% 2 != 0$ \u2192 impossible, answer $-1$.\n4. The maximal number of diagonal moves is $\\min(n, m)$. For any extra moves: if both $n$, $m$ are even/odd, you can use all moves as diagonal or detour without issue; otherwise, as long as the parity works, that's enough.\n\n#### Example:\n\nFor $(10, 1, 9)$:\n- $min\\_moves = 10$\n- $k = 9 < 10$ \u2192 Impossible\n\nFor $(2, 2, 3)$:\n- $min\\_moves = 2$\n- $k = 3 \\geq 2$\n- $(k - min\\_moves) = 1$, which is odd, so this is okay since both $n$, $m$ are even. But since he needs to land back at the destination, parity with $k$ must match $n+m$.\n\nLets formalize the check:\n\n*If $(k - \\max(n,m)) \\% 2 \\equiv (n + m) \\% 2$, then possible, else impossible.*\n\nBut actually, in 8-way moves, it's sufficient to check $(k - \\max(n, m))$ is even.\n\nLet's observe the general rule for 8-sided moves:\n\nIt **is always possible** if $k \\geq \\max(n, m)$ and $(k-\\max(n,m))$ is even.\n\n---\n\nNow, let's put this together in the final code as requested.\n\n```python\n# Your code here\nq = int(input())\nresults = []\nfor _ in range(q):\n    n, m, k = map(int, input().split())\n    min_moves = max(n, m)\n    # Check if it is possible\n    if k < min_moves:\n        results.append(-1)\n    elif (k - min_moves) % 2 != 0:\n        results.append(-1)\n    else:\n        # maximal diagonals is min(n, m)\n        results.append(k)\nprint('\\n'.join(map(str, results)))\n```", "extracted_model_code": "# Your code here\nq = int(input())\nresults = []\nfor _ in range(q):\n    n, m, k = map(int, input().split())\n    min_moves = max(n, m)\n    # Check if it is possible\n    if k < min_moves:\n        results.append(-1)\n    elif (k - min_moves) % 2 != 0:\n        results.append(-1)\n    else:\n        # maximal diagonals is min(n, m)\n        results.append(k)\nprint('\\n'.join(map(str, results)))", "result": [-2], "metadata": {"output": "-1\n-1\n-1\n", "inputs": "3\n2 2 3\n4 3 7\n10 1 9\n", "expected": "1\n6\n-1\n", "error_code": -2, "error_message": "Wrong answer at output_line_idx=0: -1 != 1"}}
+{"responses_create_params": {"background": null, "include": null, "input": [{"content": "You are a helpful and harmless assistant. You should think step-by-step before responding to the instruction below.\n\nPlease use python programming language only.\n\nYou must use ```python for just the final solution code block with the following format:\n```python\n# Your code here\n```\n\nPolycarp has $n$ different binary words. A word called binary if it contains only characters '0' and '1'. For example, these words are binary: \"0001\", \"11\", \"0\" and \"0011100\".\n\nPolycarp wants to offer his set of $n$ binary words to play a game \"words\". In this game, players name words and each next word (starting from the second) must start with the last character of the previous word. The first word can be any. For example, these sequence of words can be named during the game: \"0101\", \"1\", \"10\", \"00\", \"00001\".\n\nWord reversal is the operation of reversing the order of the characters. For example, the word \"0111\" after the reversal becomes \"1110\", the word \"11010\" after the reversal becomes \"01011\".\n\nProbably, Polycarp has such a set of words that there is no way to put them in the order correspondent to the game rules. In this situation, he wants to reverse some words from his set so that:  the final set of $n$ words still contains different words (i.e. all words are unique);  there is a way to put all words of the final set of words in the order so that the final sequence of $n$ words is consistent with the game rules. \n\nPolycarp wants to reverse minimal number of words. Please, help him.\n\n\n-----Input-----\n\nThe first line of the input contains one integer $t$ ($1 \\le t \\le 10^4$) \u2014 the number of test cases in the input. Then $t$ test cases follow.\n\nThe first line of a test case contains one integer $n$ ($1 \\le n \\le 2\\cdot10^5$) \u2014 the number of words in the Polycarp's set. Next $n$ lines contain these words. All of $n$ words aren't empty and contains only characters '0' and '1'. The sum of word lengths doesn't exceed $4\\cdot10^6$. All words are different.\n\nGuaranteed, that the sum of $n$ for all test cases in the input doesn't exceed $2\\cdot10^5$. Also, guaranteed that the sum of word lengths for all test cases in the input doesn't exceed $4\\cdot10^6$.\n\n\n-----Output-----\n\nPrint answer for all of $t$ test cases in the order they appear.\n\nIf there is no answer for the test case, print -1. Otherwise, the first line of the output should contain $k$ ($0 \\le k \\le n$) \u2014 the minimal number of words in the set which should be reversed. The second line of the output should contain $k$ distinct integers \u2014 the indexes of the words in the set which should be reversed. Words are numerated from $1$ to $n$ in the order they appear. If $k=0$ you can skip this line (or you can print an empty line). If there are many answers you can print any of them.\n\n\n-----Example-----\nInput\n4\n4\n0001\n1000\n0011\n0111\n3\n010\n101\n0\n2\n00000\n00001\n4\n01\n001\n0001\n00001\n\nOutput\n1\n3 \n-1\n0\n\n2\n1 2", "role": "user", "type": "message"}], "instructions": null, "max_output_tokens": null, "max_tool_calls": null, "metadata": null, "model": null, "parallel_tool_calls": true, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "store": null, "temperature": null, "text": null, "tool_choice": "auto", "tools": [], "top_logprobs": null, "top_p": null, "truncation": null, "user": null, "stream": null}, "response": {"id": "resp_6400f6d64edf4bd0b135fe6dd0ba6621", "created_at": 1758933048.0, "error": null, "incomplete_details": null, "instructions": null, "metadata": null, "model": "gpt-4.1-2025-04-14", "object": "response", "output": [{"id": "msg_972d1413d58a440fb2f507f40f9cfe28", "content": [{"annotations": [], "text": "Let's break down the problem and build the solution step by step:\n\n### Understanding the Game Rule\n\n- Each word must start with the last character of the previous word.\n- We can reverse words (minimize number), preserving uniqueness.\n\n### Approach\n\nThink of words as edges in a directed multigraph:\n\n- Each word \"s\" is an edge from its first character (`s[0]`) to its last character (`s[-1]`)\n- The game sequence is a **Eulerian path**: \n    - For all nodes except 0 or 1, `outdegree == indegree`\n    - For at most two nodes: one can have outdegree = indegree + 1 (start), one can have indegree = outdegree + 1 (end).\n\nReversing a word \"s\" switches the edge direction.\n\n### Steps\n\n1. For each testcase, track the number of words for each direction:\n    - \"0\" \u2192 \"1\"\n    - \"1\" \u2192 \"0\"\n    - \"0\" \u2192 \"0\"\n    - \"1\" \u2192 \"1\"\n2. Try to make number of \"0\u21921\" and \"1\u21920\" as balanced as possible by reversing some of them, but can't create duplicates when doing so.\n3. If impossible (e.g., all \"0\u21920\" and \"1\u21921\", but not all words are of one character, or cannot reach Eulerian path form), return -1.\n4. Pick a minimal set of words to reverse to balance the eulerian trail conditions.\n\n### Efficient Solution (Python)\n\nLet's implement:\n\n```python\n# Your code here\nimport sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n    n = int(sys.stdin.readline())\n    words = [sys.stdin.readline().strip() for _ in range(n)]\n    \n    # Keep track of classes, their indices, and reversed forms\n    idx_01, idx_10, idx_00, idx_11 = [], [], [], []\n    string_set = set(words)\n    \n    for i, w in enumerate(words):\n        if w[0] == '0' and w[-1] == '1':\n            idx_01.append(i)\n        elif w[0] == '1' and w[-1] == '0':\n            idx_10.append(i)\n        elif w[0] == '0' and w[-1] == '0':\n            idx_00.append(i)\n        else:\n            idx_11.append(i)\n    \n    if len(idx_01) == 0 and len(idx_10) == 0:\n        # All \"aa\" type. If both happen, impossible.\n        if len(idx_00) > 0 and len(idx_11) > 0:\n            print(-1)\n        else:\n            print(0)\n    else:\n        # The ones to potentially reverse are ones from the bigger group,\n        # but only if their reverse does not exist;\n        # Try to minimize the difference.\n        diff = abs(len(idx_01) - len(idx_10))\n        if diff <= 1:\n            print(0)\n            continue\n        # Need to reverse (diff-1)//2 words from the bigger group\n        need = (diff)//2\n        res = []\n        # If more 01, reverse some to 10\n        if len(idx_01) > len(idx_10):\n            src = idx_01\n            from_c = '0'\n            to_c = '1'\n        else:\n            src = idx_10\n            from_c = '1'\n            to_c = '0'\n        for i in src:\n            rev = words[i][::-1]\n            if rev not in string_set:\n                res.append(i+1)\n                if len(res) == need:\n                    break\n        if len(res) < need:\n            print(-1)\n        else:\n            print(len(res))\n            if len(res):\n                print(' '.join(map(str, res)))\n```\nThis code reads the input, classifies the edges, checks Eulerian path conditions, and picks a minimal set of reverses to balance the traversal, while checking uniqueness.", "type": "output_text", "logprobs": null}], "role": "assistant", "status": "completed", "type": "message"}], "parallel_tool_calls": true, "temperature": null, "tool_choice": "auto", "tools": [], "top_p": null, "background": null, "max_output_tokens": null, "max_tool_calls": null, "previous_response_id": null, "prompt": null, "reasoning": null, "service_tier": null, "status": null, "text": null, "top_logprobs": null, "truncation": null, "usage": null, "user": null}, "reward": 0.0, "extracted_model_output": "Let's break down the problem and build the solution step by step:\n\n### Understanding the Game Rule\n\n- Each word must start with the last character of the previous word.\n- We can reverse words (minimize number), preserving uniqueness.\n\n### Approach\n\nThink of words as edges in a directed multigraph:\n\n- Each word \"s\" is an edge from its first character (`s[0]`) to its last character (`s[-1]`)\n- The game sequence is a **Eulerian path**: \n    - For all nodes except 0 or 1, `outdegree == indegree`\n    - For at most two nodes: one can have outdegree = indegree + 1 (start), one can have indegree = outdegree + 1 (end).\n\nReversing a word \"s\" switches the edge direction.\n\n### Steps\n\n1. For each testcase, track the number of words for each direction:\n    - \"0\" \u2192 \"1\"\n    - \"1\" \u2192 \"0\"\n    - \"0\" \u2192 \"0\"\n    - \"1\" \u2192 \"1\"\n2. Try to make number of \"0\u21921\" and \"1\u21920\" as balanced as possible by reversing some of them, but can't create duplicates when doing so.\n3. If impossible (e.g., all \"0\u21920\" and \"1\u21921\", but not all words are of one character, or cannot reach Eulerian path form), return -1.\n4. Pick a minimal set of words to reverse to balance the eulerian trail conditions.\n\n### Efficient Solution (Python)\n\nLet's implement:\n\n```python\n# Your code here\nimport sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n    n = int(sys.stdin.readline())\n    words = [sys.stdin.readline().strip() for _ in range(n)]\n    \n    # Keep track of classes, their indices, and reversed forms\n    idx_01, idx_10, idx_00, idx_11 = [], [], [], []\n    string_set = set(words)\n    \n    for i, w in enumerate(words):\n        if w[0] == '0' and w[-1] == '1':\n            idx_01.append(i)\n        elif w[0] == '1' and w[-1] == '0':\n            idx_10.append(i)\n        elif w[0] == '0' and w[-1] == '0':\n            idx_00.append(i)\n        else:\n            idx_11.append(i)\n    \n    if len(idx_01) == 0 and len(idx_10) == 0:\n        # All \"aa\" type. If both happen, impossible.\n        if len(idx_00) > 0 and len(idx_11) > 0:\n            print(-1)\n        else:\n            print(0)\n    else:\n        # The ones to potentially reverse are ones from the bigger group,\n        # but only if their reverse does not exist;\n        # Try to minimize the difference.\n        diff = abs(len(idx_01) - len(idx_10))\n        if diff <= 1:\n            print(0)\n            continue\n        # Need to reverse (diff-1)//2 words from the bigger group\n        need = (diff)//2\n        res = []\n        # If more 01, reverse some to 10\n        if len(idx_01) > len(idx_10):\n            src = idx_01\n            from_c = '0'\n            to_c = '1'\n        else:\n            src = idx_10\n            from_c = '1'\n            to_c = '0'\n        for i in src:\n            rev = words[i][::-1]\n            if rev not in string_set:\n                res.append(i+1)\n                if len(res) == need:\n                    break\n        if len(res) < need:\n            print(-1)\n        else:\n            print(len(res))\n            if len(res):\n                print(' '.join(map(str, res)))\n```\nThis code reads the input, classifies the edges, checks Eulerian path conditions, and picks a minimal set of reverses to balance the traversal, while checking uniqueness.", "extracted_model_code": "# Your code here\nimport sys\nfrom collections import defaultdict\n\ninput = sys.stdin.readline\n\nt = int(sys.stdin.readline())\nfor _ in range(t):\n    n = int(sys.stdin.readline())\n    words = [sys.stdin.readline().strip() for _ in range(n)]\n    \n    # Keep track of classes, their indices, and reversed forms\n    idx_01, idx_10, idx_00, idx_11 = [], [], [], []\n    string_set = set(words)\n    \n    for i, w in enumerate(words):\n        if w[0] == '0' and w[-1] == '1':\n            idx_01.append(i)\n        elif w[0] == '1' and w[-1] == '0':\n            idx_10.append(i)\n        elif w[0] == '0' and w[-1] == '0':\n            idx_00.append(i)\n        else:\n            idx_11.append(i)\n    \n    if len(idx_01) == 0 and len(idx_10) == 0:\n        # All \"aa\" type. If both happen, impossible.\n        if len(idx_00) > 0 and len(idx_11) > 0:\n            print(-1)\n        else:\n            print(0)\n    else:\n        # The ones to potentially reverse are ones from the bigger group,\n        # but only if their reverse does not exist;\n        # Try to minimize the difference.\n        diff = abs(len(idx_01) - len(idx_10))\n        if diff <= 1:\n            print(0)\n            continue\n        # Need to reverse (diff-1)//2 words from the bigger group\n        need = (diff)//2\n        res = []\n        # If more 01, reverse some to 10\n        if len(idx_01) > len(idx_10):\n            src = idx_01\n            from_c = '0'\n            to_c = '1'\n        else:\n            src = idx_10\n            from_c = '1'\n            to_c = '0'\n        for i in src:\n            rev = words[i][::-1]\n            if rev not in string_set:\n                res.append(i+1)\n                if len(res) == need:\n                    break\n        if len(res) < need:\n            print(-1)\n        else:\n            print(len(res))\n            if len(res):\n                print(' '.join(map(str, res)))", "result": [-2], "metadata": {"output": "1\n3\n-1\n0\n2\n1 2\n", "inputs": "4\n4\n0001\n1000\n0011\n0111\n3\n010\n101\n0\n2\n00000\n00001\n4\n01\n001\n0001\n00001\n", "expected": "1\n3 \n-1\n0\n\n2\n1 2 \n", "error_code": -2, "error_message": "Wrong answer: mismatched output length"}}
diff --git a/environments/code_gen/prepare.py b/environments/code_gen/prepare.py
new file mode 100644
index 000000000..951471ec7
--- /dev/null
+++ b/environments/code_gen/prepare.py
@@ -0,0 +1,61 @@
+# Copyright (c) 2026, NVIDIA CORPORATION.  All rights reserved.
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+#     http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+"""Download competitive coding training and validation data from HuggingFace.
+
+Usage:
+    python environments/code_gen/prepare.py
+    python environments/code_gen/prepare.py --split train
+    python environments/code_gen/prepare.py --split validation
+"""
+
+import argparse
+from pathlib import Path
+
+
+REPO_ID = "nvidia/nemotron-RL-coding-competitive_coding"
+
+SPLITS = {
+    "train": "opencodereasoning_filtered_25k_train.jsonl",
+    "validation": "livecodebench_v5_2024-07-01_2025-02-01_validation.jsonl",
+}
+
+ARTIFACTS = {
+    "train": "opencodereasoning_filtered_25k_train.jsonl",
+    "validation": "validation.jsonl",
+}
+
+
+def prepare(split: str) -> None:
+    try:
+        from huggingface_hub import hf_hub_download
+    except ImportError:
+        raise ImportError("pip install huggingface_hub")
+
+    output_path = Path(__file__).parent / "data" / SPLITS[split]
+    output_path.parent.mkdir(parents=True, exist_ok=True)
+
+    downloaded = hf_hub_download(repo_id=REPO_ID, filename=ARTIFACTS[split], repo_type="dataset")
+    Path(downloaded).rename(output_path)
+    print(f"Wrote {output_path}")
+
+
+def main() -> None:
+    parser = argparse.ArgumentParser()
+    parser.add_argument("--split", default="train", choices=list(SPLITS))
+    args = parser.parse_args()
+    prepare(args.split)
+
+
+if __name__ == "__main__":
+    main()