"application/vnd.chemdraw+xml",
				"application/vnd.chipnuts.karaoke-mmd",
				"application/vnd.cinderella",
				"application/vnd.cirpack.isdn-ext",
				"application/vnd.claymore",
				"application/vnd.clonk.c4group",
				"application/vnd.commerce-battelle",
				"application/vnd.commonspace",
				"application/vnd.contact.cmsg",
				"application/vnd.cosmocaller",

  </mime-type>
  <mime-type type="application/vnd.cinderella">
    <glob pattern="*.cdy"/>
  </mime-type>
  <mime-type type="application/vnd.cirpack.isdn-ext"/>
  <mime-type type="application/vnd.claymore">
    <glob pattern="*.cla"/>
  </mime-type>
  <mime-type type="application/vnd.clonk.c4group">
    <glob pattern="*.c4g"/>
    <glob pattern="*.c4d"/>
    <glob pattern="*.c4f"/>

// ..., words[seq[len(seq)-2]:seq[len(seq)-1]].
//
// The implementation runs in O(n log n) time, where n = len(words),
// using the algorithm described in D. S. Hirschberg and L. L. Larmore,
// “[The least weight subsequence problem],” FOCS 1985, pp. 137-143.
//
// [The least weight subsequence problem]: https://doi.org/10.1109/SFCS.1985.60
func wrap(words []string, max int) (seq []int) {