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, 24, ['6903', '3349', '4585', 'C', 'w', 'I', 'U', 'n', '2689', 'W', '6601', '7357', '5063', 'y', '5779', 'L', '4257', 'd', '653', 'k', '8349', 'r', 'Y', '3019', 'E', '797', 'm']

A: 11368
****
Q: 2, 3, ['u', '7053', '303', '329', 'D']

A: 7356
****
Q: 4, 16, ['2829', 'j', 'q', '6425', 'e', '2487', 'y', '5207', 'j', 'Z', 'W', 'n', 'y', 'I', '4789', '6927', 'r', 'V', '5721', 'M', '9811']

A:
25835
****