Vidit, Anish and Magnus are playing world chess championship and have reached towards a dead end, find the minimal value of eq.n max, ((a, + t) mod k) + ((b; + t) mod k)+ ({c; + t} mod )) Sample...

Extracted text: Vidit, Anish and Magnus are playing world chess championship and have reached towards a dead end, find the minimal value of eq.n max, ((a, + t) mod k) + ((b; + t) mod k)+ ({c; + t} mod )) Sample input: 3 6 142 350 335 Sample output: 8. t is a non negative integer and a, b, c are arrays of length n. Input is n and k. Code in C++ only, Code must be error free else reported to admin.