Let G=(L,R;E) be a bipartite graph with color classes L and R and edge set E. A set of two bijections {φ1,φ2}, φ1,φ2:L∪R→L∪R, is said to be a 3-biplacement of G if φ1(L)=φ2(L)=L and E∩φ1∗(E)=∅, E∩φ2∗(E)=∅, φ1∗(E)∩φ2∗(E)=∅, where φ1∗, φ2∗ are the maps defined on E, induced by φ1, φ2, respectively. We prove that if ∣L∣=p, ∣R∣=q, 3≤p≤q, then every graph G=(L,R;E) of size at most p has a 3-biplacement