{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\"Oh, There is a bipartite graph.\"\"Make it Fantastic.\"\u003c/p\u003e\u003cp\u003eX wants to check whether a bipartite graph is a fantastic graph. He has two fantastic numbers, and he wants to let all the degrees to between the two boundaries. You can pick up several edges from the current graph and try to make the degrees of every point to between the two boundaries. If you pick one edge, the degrees of two end points will both increase by one. Can you help X to check whether it is possible to fix the graph?\u003c/p\u003e\u003ch3\u003eInput\u003c/h3\u003e\u003cp\u003eThere are at most $30$ test cases.\u003c/p\u003e\u003cp\u003eFor each test case,The first line contains three integers $N$ the number of left part graph vertices, $M$ the number of right part graph vertices, and $K$ the number of edges ( $1 \\le N \\le 2000$,$0 \\le M \\le 2000$,$0 \\le K \\le 6000$ ). Vertices are numbered from $1$ to $N$.\u003c/p\u003e\u003cp\u003eThe second line contains two numbers $L, R$ $(0 \\le L \\le R \\le 300)$. The two fantastic numbers.\u003c/p\u003e\u003cp\u003eThen $K$ lines follows, each line containing two numbers $U$, $V$ $(1 \\le U \\le N,1 \\le V \\le M)$. It shows that there is a directed edge from $U$-th spot to $V$-th spot.\u003c/p\u003e\u003cp\u003eNote. There may be multiple edges between two vertices.\u003c/p\u003e\u003ch3\u003eOutput\u003c/h3\u003e\u003cp\u003eOne line containing a sentence. Begin with the case number. If it is possible to pick some edges to make the graph fantastic, output \u003ccode\u003e\"Yes\"\u003c/code\u003e (without quote), else output \u003ccode\u003e\"No\"\u003c/code\u003e (without quote).\u003c/p\u003e"}},{"title":"Sample 1","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\u003e3 3 7\n2 3\n1 2\n2 3\n1 3\n3 2\n3 3\n2 1\n2 1\n3 3 7\n3 4\n1 2\n2 3\n1 3\n3 2\n3 3\n2 1\n2 1\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: Yes\nCase 2: No\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr /\u003e"}}]}