We prove that the shortest word accepted by an n-state intersection selective nondeterministic automaton with nonempty language can be of length O( e n log n).