In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']
14713

1, 4, ['o', 'O', '7355', 'S', '2513', 'f', '4189']
7355

3, 13, ['9585', '4573', '8113', '4163', 'D', '4641', '2077', 'D', '5339', 'Y', 'Z', '9133', '9401', 'o', '5033', 'd', '1745', '1357', '5513', '5369', 'N', '9355', 'C', 'W', 'C']

42867