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: 1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']

A: 12852
****
Q: 2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

A: 10176
****
Q: 1, 5, ['l', '4161', 'E', '7889', '9957', 'u']

A:
22007
****