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.

2, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']
19665

3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']
62091

17, 28, ['r', '9311', 'a', 'T', 'U', 'S', '5385', 'e', '3117', '4641', '7295', '3907', '8721', 'G', '9113', 'd', 'm', 'y', 'x', '2699', '6769', '6847', '5187', '6835', 'z', 'v', 'Y', 'I', 'f', 'Z']

28337