How to build such a grammar?

Question

IT education

It is required to construct a grammar generating the language
L = {2*2-1,2*2*2-1-1,2*2*2*2-1-1-1,....}, here there are one more twos than units, and there is at least one "-" sign, is it possible to convert this grammar to type 3?
My version was like this:
G = ( {S,A,B} , {2,*,1,-}, P, S } )
S -> A2B
A -> A2* | E
B -> -1B | E
I know that the option is wrong, because the minus may not appear + as I was told, we can apply rule B more times (compared to A, then there will be more units)

Answer 1

S -> 2*2A-1
A -> *2A-1 | E