{"trustable":false,"sections":[{"title":"描述","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"zh-CN\"\u003e\n \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;有一个叫Reza的小孩很皮,当他玩好玩具之后从来都不放回去.爸爸妈妈给了他一个矩形的盒子来收纳他的玩具.不过Reza很皮,每次只是简单的把玩具扔到箱子里.所以所有玩具混在了一起Reza就再也找不到他最喜欢的玩具了.\n \u003cbr\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;爸爸妈妈想出了如下主意:他们往箱子里插了一些隔板.即使Reza继续把玩具扔到盒子里,至少玩具们会被分到不同的隔间.这个盒子俯视图: \n \u003ccenter\u003e\u003cimg SRC\u003d\"CDN_BASE_URL/2bf59cc9736024c881fe0d72d51a4470?v\u003d1535615936\"\u003e\u003c/center\u003e\n \u003cbr\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;我们想知道对于每一个正整数t,有多少个隔间刚好有t个玩具\n \u003c/div\u003e"}},{"title":"输入","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"zh-CN\"\u003e\n \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;输入由一些样例组成.每个样例第一行有6个整数n,m,x1,y1,x2,y2.隔板数量n(0\u0026lt;n\u0026lt;\u003d1000)和玩具数量m(0\u0026lt;m\u0026lt;\u003d0\u003d1000).(x1,y1)和(x2,y2)是矩形左上角和右下角的坐标接下来n行每行两个数字Ui,Di代表着隔板上坐标(Ui,y1)和下坐标(Di,y2).你可以假定隔板们不会相交,再接下来m行每行两个数字x,y代表着玩具落地时的坐标(x,y).你还可以假定玩具不会落在隔板上\n \u003cbr\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;一行单独的0代表着输入结束.\n \u003c/div\u003e"}},{"title":"输出","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"zh-CN\"\u003e\n 对于每个盒子,第一行输出\"Box\".然后输出一个数字代表t,一个冒号和空格,紧跟着的是恰好有t个玩具个隔间数量.输出顺序按照t的大小从小到大输出\n \u003c/div\u003e"}},{"title":"样例输入","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e4 10 0 10 100 0\n20 20\n80 80\n60 60\n40 40\n5 10\n15 10\n95 10\n25 10\n65 10\n75 10\n35 10\n45 10\n55 10\n85 10\n5 6 0 10 60 0\n4 3\n15 30\n3 1\n6 8\n10 10\n2 1\n2 8\n1 5\n5 5\n40 10\n7 9\n0\n\u003c/pre\u003e"}},{"title":"样例输出","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003eBox\n2: 5\nBox\n1: 4\n2: 1\n\u003c/pre\u003e"}}]}