We show that for any 2-computably enumerable Turing degree ${\bf l}$, any computably enumerable degree ${\bf a}$ and any Turing degree ${\bf s}$, if ${\bf l'=\boldsymbol{0}'}$, ${\bf l<a}$, ${\bf s\geq \boldsymbol{0}'}$, and ${\bf s}$ is c.e. in ${\bf a}$, then there is a 2-computably enumerable degree ${\bf x}$ with the following properties:

1. ${\bf l<x<a}$; and

2. ${\bf x'=s}$