For given a graph H, a graphic sequence pi = (d(1), d(2), ... , d(n)) is said to be potentially H-graphic if there is a realization of pi containing H as a subgraph. In this paper, we characterize the potentially K-1,K-1,K-s-positive graphic sequences for s = 4 and 5, where K-1,K-1,K-s is the 1 x 1 x s complete 3-partite graph. These characterizations imply the values of sigma(K-1,K-1,K-s, n) for s = 4 and 5.