Tripartite Palindromic Partition of Integer (HP 50g) Challenge

[Gerald H]

It has been proven that every positive integer is the sum of at most three palindromic integers, eg

808182838485868788

is the sum of

715133112211331517
+ 89258189498185298
+ 3791536776351973

I am very interested to see whether someone, anyone, has or can produce a programme for the 50g that calculates such a partition for any positive integer input.

Should such a programme be published here I would present the poster with a calculator (either 50g, 21S or 38G - choice up to poster) – if more than one programme posted, best programme (in my eyes) receives the calculator.