Queen`s Attack II Hackerrank - C# - Terminated due to timeout

Question

Good afternoon. I made the challenge of Queen’s Attack (I started programming a few days ago) and I can’t get 100% approval on this challenge. It’s said that my code needs to be optimized, but I don’t know how to do that. I know that the same is long and in some repetitive moments, but did not know how to improve the same.

    public static int queensAttack(int n, int k, int r_q, int c_q, List<List<int>> obstacles)
{
    int nbmrOfMoves = 0;
    bool shouldBreak = false;
            
    for(int i = 1; i < n; i++){
        for(int x = 0; x<k; x++){
            if(r_q + i == obstacles[x][0] && c_q == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(r_q + i <= n){
            nbmrOfMoves++;
        }
    }
    shouldBreak = false;
    
    for(int i = 1; i < n; i++){
        for(int x = 0; x<k; x++){
            if(r_q - i == obstacles[x][0] && c_q == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(r_q - i > 0){
            nbmrOfMoves++;
        }
    }
    shouldBreak = false;
    for(int i = 1; i < n; i++){
        for(int x = 0; x<k; x++){
            if(r_q == obstacles[x][0] && c_q - i == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(c_q - i >0){
            nbmrOfMoves++;
        }
    }
    shouldBreak = false;
    
    for(int i = 1; i < n; i++){
        for(int x = 0; x<k; x++){
            if(r_q == obstacles[x][0] && c_q + i == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(c_q + i <= n){
            nbmrOfMoves++;
        }
    } 
    shouldBreak = false;
    
    for (int i = 1; i < n; i++){
        for(int x = 0; x < k; x++){
            if(r_q + i == obstacles[x][0] && c_q + i == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(r_q + i <= n && c_q + i <= n){
            nbmrOfMoves++;
        }
    }
    shouldBreak = false;
    
    for (int i = 1; i < n; i++){
    
        for(int x = 0; x < k; x++){
            if(r_q - i == obstacles[x][0] && c_q + i == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(r_q - i > 0 && c_q + i <= n){
            nbmrOfMoves++;
        }
    }
    shouldBreak = false;
    
    for (int i = 1; i < n; i++){
        for(int x = 0; x < k; x++){
            if(r_q + i == obstacles[x][0] && c_q - i == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(r_q + i <= n && c_q - i > 0){
            nbmrOfMoves++;
        }
    }
    shouldBreak = false;
    
    for (int i = 1; i < n; i++){
        for(int x = 0; x < k; x++){
            if(r_q - i == obstacles[x][0] && c_q - i == obstacles[x][1]){
                shouldBreak = true;
            }
        }
        if(shouldBreak == true){
            break;
        }
        if(r_q - i > 0 && c_q - i > 0){
            nbmrOfMoves++;
        }
    }
    
return nbmrOfMoves;
}
}