code: private final int m() {
  		int n = 0;
  		int i = k0;
  		while (true) {
  			if (i > j)
  				return n;
  			if (!cons(i))
  				break;
  			i++;
  		}
  		i++;
  		while (true) {
  			while (true) {
  				if (i > j)
  					return n;
  				if (cons(i))
  					break;
  				i++;
  			}
  			i++;
  			n++;
  			while (true) {
  				if (i > j)
  					return n;
  				if (!cons(i))
  					break;
  				i++;
  			}
  			i++;
  		}
  	}
docs: /*
  m() measures the number of consonant sequences between k0 and j. if c is
  a consonant sequence and v a vowel sequence, and <..> indicates arbitrary
  presence,
  
  <c><v> gives 0 <c>vc<v> gives 1 <c>vcvc<v> gives 2 <c>vcvcvc<v> gives 3
  ....