## CLIQSEP - Clique Separation

## Problem

Let **G** be the set of di-graphs with **n** nodes, **m** edges and maximum clique (complete subgraph) size of **k** nodes,
determine whether it is possible to divide every element of **G** into two disjoint sets of nodes, such that the largest
size of a clique contained in one set is equal to the largest size of a clique contained in the other set.

## The Input

Each line of input has **n <= 1000 , m <= 1000000 , k <= n **, listed in that order.

## The Output

For each line of input, output "yes" if it is possible, "no" if it is not possible.

## Sample Input

10 99 8 9 80 3

## Sample Output

yes no

Problemsetter --- Chen, Xiaohong

Added by: | Chen Xiaohong |

Date: | 2007-11-06 |

Time limit: | 1s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |