Do no search if there is only one option (ala umsg())

This would cause an infinite loop (one of the first two continues would
*ALWAYS* occure)

src/uifc/uifc32.c

@@ -1384,7 +1384,7 @@ int ulist(int mode, int left, int top, int width, int *cur, int *bar
 			}
 			else {
 				i&=0xff;
-				if(isalnum(i) && opts && option[0][0]) {
+				if(isalnum(i) && opts>1 && option[0][0]) {
 					search[s]=i;
 					search[s+1]=0;
 					for(j=(*cur)+1,a=b=0;a<2;j++) {   /* a = search count */