My Java solution with o(1) time complexity and o(1) space:

public static int towerBreakers(int n, int m) {
        if(m == 1 || n % 2 == 0) return 2;
        else return 1;
    }

Here is my Python solution!

def towerBreakers(n, m):
    if m == 1:
        return 2
    elif n % 2 == 0:
        return 2
    return 1

Not my own solution

test = int(input())
for _ in range(test):
    n,m = map(int,input().strip().split())
    if m==1:
        print(2)
    else:
        if n%2==1:
            print(1)
        else:
            print(2)

`

Efficient and reliable dumpster rentals in Little Rock! Perfect for junk removal, debris, and cleanup projects. Choose from large 3yd dumpsters to fit your specific needs. Affordable rates and hassle-free service guaranteed. Call us now to secure your spot and get started! Clean up made easy—don’t wait, contact us today!

hello guys mai apka apna salil singh