{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"You have an array with **n** elements which is indexed from **0** to **n - 1**. Initially all elements are zero. Now you have to deal with two types of operations:\n\n1. Increase the numbers between indices **i** and **j** (inclusive) by **1**. This is represented by the command **\u00270 i j\u0027**.\n2. Answer how many numbers between indices **i** and **j** (inclusive) are divisible by **3**. This is represented by the command **\u00271 i j\u0027**."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026le; 5)**, denoting the number of test cases.\n\nEach case starts with a line containing two integers **n (1 \u0026le; n \u0026le; 10\u003csup\u003e5\u003c/sup\u003e)** and **q (1 \u0026le; q \u0026le; 50000)** denoting the number of queries. Each query will be either in the form **\u00270 i j\u0027** or **\u00271 i j\u0027** where **i**, **j** are integers and **0 \u0026le; i \u0026le; j \u0026lt; n**.\n"}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number first. Then for each query in the form **\u00271 i j\u0027**, print the desired result.\n"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1\n10 9\n0 0 9\n0 3 7\n0 1 4\n1 1 7\n0 2 2\n1 2 4\n1 8 8\n0 5 8\n1 6 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1:\n2\n3\n0\n2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"Dataset is huge, use faster I/O methods.\n"}}]}