Christmas Puzzle

Let's employ our Brainfuck++ skills to build a beautiful Christmas fir-tree!

(some people ignore the line above, so let's repeat - this problem should be solved in BF language, not python, c++ or any other)

Your Christmas Tree should look like this:

      +
     +++
    +++++
   +++++++
     +++
   +++++++
 +++++++++++
      +
      +

The exact form is specified with a sequence of integers in the following manner:

• fir-tree consists of several sections, each described with 3 values
• first value is the amount of lines in the section
• second is the length of the first line in the section (always odd)
• third is increment of line length, halved, non-negative
• processing shall end after section with increment of 0

Here is an example: fir-tree above consists of 3 sections (two triangular and the trunk). First section is of 4 lines, starts with line having only 1 symbol and increments by 1 on each side. The second section has 3 lines, starts from 3 and adds 2 characters on each side with every next line. The trunk has 2 lines, its width is 1 and increment obviously 0:

4 1 1 3 3 2 2 1 0

Notes:

• the example input is given exactly for example! your code shall be verified against different, random input on the server side!
• both extended io and stack in BF engine are enabled for this task
• add padding with spaces at start of every line to make fir aligned, exact number is not important, fir isn't going to be wider than 79 characters
• lines (including the last) are ended with CR symbol with code 13