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.

1, 2, ['1907', '1489', 'm', '4571', 'a']
3396

1, 10, ['H', 'P', '1985', '1797', '9115', 'V', 'o', '2405', '7817', 't', 'C']
23119

1, 15, ['p', 'f', 'm', 'o', '1571', '5595', '7033', '5561', '1179', '8823', '6509', 'X', 'B', '9811', '7139', 'W', '19']

53221