{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n h1 { font-size: 1.2em; }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"md\"\u003e\u003cp\u003eHá \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e meninos e \u003cspan class\u003d\"math inline\"\u003e$ m $\u003c/span\u003e meninas em uma escola. Na próxima semana, haverá um baile da escola. Um par de dança consiste em um menino e uma menina, e existem \u003cspan class\u003d\"math inline\"\u003e$ k $\u003c/span\u003e pares potenciais.\u003c/p\u003e\n\u003cp\u003eSua tarefa é descobrir o número máximo de pares de dança e mostrar como esse número pode ser alcançado.\u003c/p\u003e\n\u003ch1 id\u003d\"input\"\u003eEntrada\u003c/h1\u003e\n\u003cp\u003eA primeira linha de entrada contém três inteiros \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e, \u003cspan class\u003d\"math inline\"\u003e$ m $\u003c/span\u003e e \u003cspan class\u003d\"math inline\"\u003e$ k $\u003c/span\u003e: o número de meninos, meninas e pares potenciais. Os meninos são numerados de \u003cspan class\u003d\"math inline\"\u003e$ 1,2,\\dots,n $\u003c/span\u003e, e as meninas são numeradas de \u003cspan class\u003d\"math inline\"\u003e$ 1,2,\\dots,m $\u003c/span\u003e.\u003c/p\u003e\n\u003cp\u003eDepois disso, há \u003cspan class\u003d\"math inline\"\u003e$ k $\u003c/span\u003e linhas descrevendo os pares potenciais. Cada linha tem dois inteiros \u003cspan class\u003d\"math inline\"\u003e$ a $\u003c/span\u003e e \u003cspan class\u003d\"math inline\"\u003e$ b $\u003c/span\u003e: o menino \u003cspan class\u003d\"math inline\"\u003e$ a $\u003c/span\u003e e a menina \u003cspan class\u003d\"math inline\"\u003e$ b $\u003c/span\u003e estão dispostos a dançar juntos.\u003c/p\u003e\n\u003ch1 id\u003d\"output\"\u003eSaída\u003c/h1\u003e\n\u003cp\u003ePrimeiro imprima um inteiro \u003cspan class\u003d\"math inline\"\u003e$ r $\u003c/span\u003e: o número máximo de pares de dança. Depois disso, imprima \u003cspan class\u003d\"math inline\"\u003e$ r $\u003c/span\u003e linhas descrevendo os pares. Você pode imprimir qualquer solução válida.\u003c/p\u003e\n\u003ch1 id\u003d\"constraints\"\u003eRestrições\u003c/h1\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le n,m \\le 500 $\u003c/span\u003e\u003c/li\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le k \\le 1000 $\u003c/span\u003e\u003c/li\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le a \\le n $\u003c/span\u003e\u003c/li\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le b \\le m $\u003c/span\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch1 id\u003d\"example\"\u003eExemplo\u003c/h1\u003e\n\u003ctable class\u003d\"vjudge_sample\"\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\u003e3 2 4\n1 1\n1 2\n2 1\n3 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1 2\n3 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e"}}]}