def tower_breakers(n, m):
    # Time complexity: O(1)
    # Space complexity (ignoring input): O(1)
    # If number of towers is pair, whatever player 1 does, player 2 mimics and wins.
    # If n is odd, player 1 push a tower to 1 and the game becomes a n is pair case
    if m == 1:
        return 2
    
    if n % 2 == 0:
        return 2
    else:
        return 1

fn tower_breakes(n: i32, m: i32) -> i32 {
    //Time complexity: O(1)
    //Space complexity (ignoring input): O(1)
    //If number of towers is pair, whatever player 1 does, player 2 mimics and wins.
    //If n is odd, player 1 push a tower to 1 and the game becomes a n is pair case
    if m == 1 {
        return 2;
    }

    if n % 2 == 0 {
        2
    } else {
         1
    }
}

fn towerBreakers(n: i32, m: i32) -> i32 {
    if m == 1 || n % 2 == 0 { 
        2 
    } else { 
        1 
    }
}