use List::MoreUtils qw( all first_index indexes );

# Is $l1 in $l2? It's kinda a bit destructive.
sub in_list {
    my ($l1, $l2) = @_;

    my $head = shift @$l1;
    my $head_idx = first_index { $head eq $_ } @$l2;
    return unless defined $head_idx;

    # Make sure $l2 is still big enough to hold $l1
    return unless $#$l2 - $head_idx >= $#$l1;

    return all { $l1->[$_] eq $l2->[$_ + $head_idx] } indexes @$l1;
}