266609289### THIS IS MY FIRST TIME WRITING A BLOG IDK HOW TO PROPERLY DO IT ....I HOPE EVERYONE CAN UNDERSTAND WHAT I AM SAYING

Problem Statement:Manhattan Permutations(Codeforces Round 953 Div 2) In my code i am using int n,k; but the problem is it is giving me wrong answer because one testcase is (1 1000000000000) which is integer out of bound

MY concern is why after this one testcase all of my other tescases is giving me wrong answers , and when i remove this one testcase ...my code runs perfectly fine

Can someone explain me what is happening....i will pin my code screenshot .....PLZ PLZ PLZ!!! explain me why that one testcase is causing other testcases to fail(this is my main problem).