```python # -*- coding:utf-8 -*- class Solution: def movingCount(self, k, r, c): # write code here self.cnt = 0 if r == 0 or c == 0: return 0 def p_sum(x, y): res = 0 while x: res += x%10 x = x//10 while y: res += y%10 y = y//10 return res <= k mat = [[1 for _ in range(c)] for _ in range(r)] def dfs(i, j): if not (0<=i<r and=""><=j</r>