Number of ways in which A,B,C can be given 3 tiles
i.e., 3 equal groups of 9 tiles and distributed =n(S)=9!⋅3!(3!)3⋅3!=1680
Now, we have 1,3,5,7,9 (odd numbers); 2,4,6,8 (even numbers)
In order that all the 3 persons must have an odd total, one person must have all the 3 tiles marked with odd number and each of the remaining two persons must have 2 tiles with even marked and 1 tile with odd marked.
One person can be selected in 3C1 ways.
3 odd tiles out of 5 can be selected in 5C3 ways.
The remaining two odd tiles can be selected and distributed in 2C1 ways.
Remaining 4 even tiles can be equally distributed in 4!⋅2!(2!)2⋅2! ways.
∴n(E)=3C1⋅5C3⋅2C1⋅4!⋅2!(2!)2⋅2!
=3⋅10⋅2⋅6=360
Probability, P(E)=n(E)n(S)=3601680=314=mn
∴|2m−n|=|2×3−14|=8