An H3 graph is a multigraph on three vertices with double edges between two pairs of distinct vertices and a single edge between the third pair. In this paper, we decompose a complete multigraph 2K10t into H3 graphs.