Palindromic Decomposition

It has recently been proved (2016) that:
For g ≥ 5 every integer can be decomposed as a sum of 3 palindromes in base g.

For instance : $123456789=40904+4708074+118707811$ (base 10)

How many such decompositions $n=x+y+z\text{ and }0<x\le y\le z$ are there for $n=314159263$ (in base 10)

Answer format: count,x,y,z // Decomposition with the largest x

[My timing : 15 sec]