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

12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']
22751

8, 22, ['R', 'Q', '9117', '2883', 'h', 'E', '1747', 'l', 'U', 'k', 'W', '3365', '7093', 'a', 'm', '7509', 'm', 'a', 'j', 'S', '1023', 'M', 'Y', 'X', '5947', '7301', '2645', '9229']

18990