XOR profit problem

while custom inputs its giving right output but when submit all testcaseses are wrong.

Why are you simply printing m^n ? This is wrong.
Consider all the xor pairs possible and print the maximum, it would pass the time limit.

I did not understood.

can you change the code of mine .