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: 11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']

A: 1263
****
Q: 1, 3, ['7641', '5147', '995', 's', '6697']

A: 13783
****
Q: 5, 12, ['n', '3017', 'u', '5649', 'e', 'J', '7065', '2695', 'n', 'z', '3999', 'e', 'b', '3375', '2637', '4825', 'm', 'p', 'h', 'H']

A:
13759
****
