Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP (Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing)