And this again emphasizes the fact, small vertex covers are easy to find even if we don't know that a graph has a small vertex cover as long as it is small, it will be easy to find and for any fixed k, so either in the decision variant, we fixed k or we say we look at all graphs that say have a vertex cover of size 10 or 20 or 30, we can solve this NP complete problem in polynomial time. 