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: 2, 10, ['143', '3769', '197', '3281', '1839', '8009', 'J', '1019', 'Z', 'y', 'M', 'w', '827', '3603', 'r', '6401', '1039']

A: 18114
****
Q: 15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']

A: 34357
****
Q: 7, 18, ['8921', 'Q', 'u', '8013', '7465', '2531', '3865', '4991', 'h', '487', '1689', '6677', '6255', 'f', 'V', 'y', '8819', '8599', '9399', 'Q', 'V', 'Z', '1433', 'K', '9353', '583']

A:
41382
****