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: 17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']

A: 1339
****
Q: 2, 15, ['r', '3527', 'Z', '9011', 'm', '879', '5305', '7153', 'c', '3567', 'd', '2319', 'M', 'y', '7703', '4899', 'G']

A: 39464
****
Q: 8, 18, ['9945', '6709', 'e', '4555', 'O', '4799', 'E', 'l', '2847', '211', 'S', '2347', 'J', '3661', '3143', '7831', 'G', 'g', 'L', '1871', '8187', '4239', 'p', '4663', 'p', '5661', 'D', '9595', 'F']

A:
20040
****