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.

Q: 21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']

A: 20962
****
Q: 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']

A: 14713
****
Q: 2, 2, ['c', '3427', 'C', 'G', 'J', '8763', 'g', 'J', '9817', 'q', 'T', 'H', 't', 'L', 'U', 'p', '9429', 'I', 'W', 'S', 'B', '3489']

A:
3427
****