be a circle inscribed inside a rhombus 
.
and 
be variable points on 
and 
respectively, such as 
is always the tangent line to 
is the same.
,
such that any graph with 
vertices and at least 
passing through point 
Y by Adventure10, Mango247
The set 
is partitioned to three subsets 
and 
For each subset the sum of its elements, the product of its elements and the sum of the digits of all its elements are calculated.
Is it possible that
alone has the largest sum of elements, 
alone has the largest product of elements, and 
alone has the largest sum of digits?
is partitioned to three subsets 
and 
For each subset the sum of its elements, the product of its elements and the sum of the digits of all its elements are calculated.Is it possible that
alone has the largest sum of elements, 
alone has the largest product of elements, and 
alone has the largest sum of digits?
.
