code: def m(self):
          
          n = 0
          i = self.k0
          while 1:
              if i > self.j:
                  return n
              if not self.cons(i):
                  break
              i = i + 1
          i = i + 1
          while 1:
              while 1:
                  if i > self.j:
                      return n
                  if self.cons(i):
                      break
                  i = i + 1
              i = i + 1
              n = n + 1
              while 1:
                  if i > self.j:
                      return n
                  if not self.cons(i):
                      break
                  i = i + 1
              i = i + 1
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
             ....