51st Ukrainian National Mathematical Olympiad, 3rd Round

There are 10 piles of stones, with $3$, $4$, $5$, $\dots$, $12$ stones respectively. At one step one can pick three piles and add $1$ stone to the first pile, $2$ stones to the second pile, $3$ stones to the third pile, or pick any three piles and take $1$ stone out of first pile, $2$ stones out of second pile, $3$ stones out of third pile, provided that each pile has enough stones. Is it possible after finite number of such operations to get exactly $2011$ stones in each pile?