Let G be a bipartite graph with bipartition (A, B) where |A|-|B|=2k for some positive integer k. Suppose that |N(X)||X| for all X CA with |X|<k, and [N(Y)|≥ |Y for all Y CB with Y≤k. Prove that G has a perfect matching.