Bipartite realization problem

The sequences above are able to be the degree sequence for the bipartite graph below it, where each vertex has a degree equal to the number assigned to it.

The bipartite realization problem is a classical decision problem in graph theory, a branch of combinatorics. Given two finite sequences and of natural numbers with , the problem asks whether there is a labeled simple bipartite graph such that is the degree sequence of this bipartite graph.