Q: Given three sorted arrays, find the k-th smallest element using limited access to the array.
I: [Read the three arrays bypassing API](https://uoj.ac/submission/685752), [rob the arrays and feed main a fake input](https://uoj.ac/submission/396637), or just [totally skip main](https://uoj.ac/submission/616101)