Pancyclicity Mod 5 Of K_1,4-free Graphs

For two intergers k (>0)and s( >0), a cycle which length is l is called an ( s modk)?cycle if l ≡smodk. A graph is said to be pancyclic mod k if G has an ( s modk)?cycle for every s ( 0≤s