




def  snake_case(    __magic_name__			,		__magic_name__			,		__magic_name__			,		__magic_name__   )			->							int:





     '''simple docstring'''


     lowercase      ,	lowercase :       Any       =			len(__magic_name__   ), len(grid[0]   )
     if (
         min(__magic_name__			,		__magic_name__   ) < 0
         or row == row_length
         or col == col_length
         or (row, col) in visit
         or grid[row][col] == 1
     ):
          return 0
     if row == row_length - 1 and col == col_length - 1:
          return 1

     visit.add((row, col)   )

     lowercase :       Optional[int]       =			0
     count += depth_first_search(__magic_name__			,		row + 1			,		__magic_name__			,		__magic_name__   )
     count += depth_first_search(__magic_name__			,		row - 1			,		__magic_name__			,		__magic_name__   )
     count += depth_first_search(__magic_name__			,		__magic_name__			,		col + 1			,		__magic_name__   )
     count += depth_first_search(__magic_name__			,		__magic_name__			,		col - 1			,		__magic_name__   )

     visit.remove((row, col)   )
     return count


if __name__ == "__main__":
 import doctest

 doctest.testmod()





lowerCAmelCase_						=			range(2, 20 + 1)
lowerCAmelCase_						=			[10**k for k in range(ks[-1] + 1)]
lowerCAmelCase_						=			{}






def  snake_case(    __magic_name__			,		__magic_name__			,		__magic_name__			,		__magic_name__   )			->							Any:





     '''simple docstring'''


     lowercase :       str       =			sum(a_i[j] for j in range(__magic_name__			,		len(__magic_name__   )   )   )
     lowercase :       Any       =			sum(a_i[j] * base[j] for j in range(min(len(__magic_name__   )			,		__magic_name__   )   )   )

     lowercase      ,	lowercase :       Optional[int]       =			0, 0
     lowercase :       str       =			n - i

     lowercase :       Optional[int]       =			memo.get(__magic_name__   )

     if sub_memo is not None:
          lowercase :       List[str]       =			sub_memo.get(__magic_name__   )

          if jumps is not None and len(__magic_name__   ) > 0:
               # find and make the largest jump without going over
               lowercase :       Dict       =			-1
               for _k in range(len(__magic_name__   ) - 1			,		-1			,		-1   ):
                    if jumps[_k][2] <= k and jumps[_k][1] <= max_dn:
                         lowercase :       Any       =			_k
                         break

               if max_jump >= 0:
                    lowercase      ,	lowercase      ,	lowercase :       List[str]       =			jumps[max_jump]
                    # since the difference between jumps is cached, add c
                    lowercase :       str       =			diff + c
                    for j in range(min(__magic_name__			,		len(__magic_name__   )   )   ):
                         lowercase      ,	lowercase :       Optional[Any]       =			divmod(__magic_name__			,		10   )
                    if new_c > 0:
                         add(__magic_name__			,		__magic_name__			,		__magic_name__   )

          else:
               lowercase :       Dict       =			[]
     else:
          lowercase :       Union[str, Any]       =			{c: []}
          lowercase :       Optional[Any]       =			sub_memo

     if dn >= max_dn or c + diff >= base[k]:
          return diff, dn

     if k > ks[0]:
          while True:
               # keep doing smaller jumps
               lowercase      ,	lowercase :       str       =			next_term(__magic_name__			,		k - 1			,		i + dn			,		__magic_name__   )
               diff += _diff
               dn += terms_jumped

               if dn >= max_dn or c + diff >= base[k]:
                    break
     else:
          # would be too small a jump, just compute sequential terms instead
          lowercase      ,	lowercase :       Optional[Any]       =			compute(__magic_name__			,		__magic_name__			,		i + dn			,		__magic_name__   )
          diff += _diff
          dn += terms_jumped

     lowercase :       Optional[Any]       =			sub_memo[c]

     # keep jumps sorted by # of terms skipped
     lowercase :       List[Any]       =			0
     while j < len(__magic_name__   ):
          if jumps[j][1] > dn:
               break
          j += 1

     # cache the jump for this value digitsum(b) and c
     sub_memo[c].insert(__magic_name__			,		(diff, dn, k)   )
     return (diff, dn)






def  snake_case(    __magic_name__			,		__magic_name__			,		__magic_name__			,		__magic_name__   )			->							Optional[int]:





     '''simple docstring'''


     if i >= n:
          return 0, i
     if k > len(__magic_name__   ):
          a_i.extend([0 for _ in range(k - len(__magic_name__   )   )]   )

     # note: a_i -> b * 10^k + c
     # ds_b -> digitsum(b)
     # ds_c -> digitsum(c)
     lowercase :       Optional[Any]       =			i
     lowercase      ,	lowercase      ,	lowercase :       List[str]       =			0, 0, 0
     for j in range(len(__magic_name__   )   ):
          if j >= k:
               ds_b += a_i[j]
          else:
               ds_c += a_i[j]

     while i < n:
          i += 1
          lowercase :       List[str]       =			ds_c + ds_b
          diff += addend
          lowercase :       Tuple       =			0
          for j in range(__magic_name__   ):
               lowercase :       int       =			a_i[j] + addend
               lowercase      ,	lowercase :       Any       =			divmod(__magic_name__			,		10   )

               ds_c += a_i[j]

          if addend > 0:
               break

     if addend > 0:
          add(__magic_name__			,		__magic_name__			,		__magic_name__   )
     return diff, i - start_i






def  snake_case(    __magic_name__			,		__magic_name__			,		__magic_name__   )			->							Tuple:





     '''simple docstring'''


     for j in range(__magic_name__			,		len(__magic_name__   )   ):
          lowercase :       Any       =			digits[j] + addend
          if s >= 10:
               lowercase      ,	lowercase :       List[str]       =			divmod(__magic_name__			,		10   )
               lowercase :       List[str]       =			addend // 10 + quotient
          else:
               lowercase :       Optional[Any]       =			s
               lowercase :       Tuple       =			addend // 10

          if addend == 0:
               break

     while addend > 0:
          lowercase      ,	lowercase :       str       =			divmod(__magic_name__			,		10   )
          digits.append(__magic_name__   )






def  snake_case(    __magic_name__ = 10**15   )			->							int:





     '''simple docstring'''


     lowercase :       List[Any]       =			[1]
     lowercase :       List[Any]       =			1
     lowercase :       str       =			0
     while True:
          lowercase      ,	lowercase :       str       =			next_term(__magic_name__			,		20			,		i + dn			,		__magic_name__   )
          dn += terms_jumped
          if dn == n - i:
               break

     lowercase :       str       =			0
     for j in range(len(__magic_name__   )   ):
          a_n += digits[j] * 10**j
     return a_n


if __name__ == "__main__":
 print(f'''{solution() = }''')