A non-increasing sequence π=(d1,...,dn of nonnegative integers is said to be graphic if it is realizable by a simple graph G on n vertices. A graphic sequence π=(d1,...,dn is said to be potentially 3Cl-graphic if there is a realization of π containing cycles of every length r, 3 ≤ r ≤ l. It is well-known that if the nonincreasing degree sequence (d1,..., dl) of a graph G on l vertices satisfies the Pósa condition that dl +1-i ≥ i + 1 for every i with 1 ≤ i < l/2, then G is either pancyclic or bipartite. In this paper, we obtain a Pósa-type condition of potentially 3Cl-graphic sequences, that is, we prove that if l ≥ 5 is an integer, n ≥ l and π=(d1,...,dn is a graphic sequence with dl +1-i ≥ i + 1 for every i with 1 ≤ i < l/2, then π is potentially 3Cl-graphic. We show that this result is an asymptotic solution to a problem due to Li et al.[Adv. Math. (China), 2004, 33(3):273-283]. As an application, we also show that this result completely implies the value σ(Cl, n) for l ≥ 5 and n ≥ l due to Lai[J. Combin. Math. Combin. Comput., 2004, 49:57-64].