import java.util.*;
public class Solution {
    public int movingCount(int threshold, int rows, int cols) {
        Queue<int[]> que = new LinkedList<>();
        int count = 0;

        boolean[][] used = new boolean[rows][cols];

        que.offer(new int []{0,0});
        used[0][0] = true;

        while(!que.isEmpty()){
            int[] p = que.poll();
            count++;

            int x = p[0];
            int y = p[1];

            if(x+1<rows && !used[x+1][y]){
                int sum1 = computeSum(x+1,y);
                used[x+1][y] = true;
                if(sum1<=threshold) que.offer(new int[]{x+1,y});
            }

            if(y+1<cols && !used[x][y+1]){
                int sum3 = computeSum(x,y+1);
                used[x][y+1]= true;
                if(sum3<=threshold) que.offer(new int[]{x,y+1});
            }   
        }

        return count; 
    }

    public int computeSum(int x, int y){
        int sum = 0;
        while(x!=0){
            sum+=x%10;
            x = x/10;
        }

        while(y!=0){
            sum+=y%10;
            y=y/10;
        }

        return sum;
    }

    
}