The degree of every vertex in a $k$-regular bipartite graph with parts of size $m$ is $k$. What is the relationship between the number of edges $E$ and $m, k$?