Given a list assignment of L to graph G, assign a list L(v) of colors to each . An (L, d)*-coloring is a mapping π that assigns a color π(v) L(v) to each vertex vV(G) such that at most d neighbors of v receive the color v. If there exists an (L, d)*-coloring for every list assignment L with for all , then G is called to be (k, d)*-choosable. In this paper, we prove every planar graph G without adjacent k-cycles is (3, 1)*-choosable, where k {3, 4, 5}.