How do I show that Shortest-Cycle-Length is NL hard?


Shortest-Cycle-Length takes a graph G and a positive integer l, and outputs 1 if and only if the shortest cycle in G (if there is any) has a length l.

To show that above is NL hard, I tried to reduce STCONN (s-t connectivity), or maybe Cycle, but not sure where to go from here.