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: 2, 2, ['5189', 'J']

A: 0
****
Q: 7, 26, ['I', 'K', '7025', 'g', '271', '9365', 'i', '449', 'q', '8499', '4887', 'M', '885', '3831', '4789', 'I', '8181', 'b', 'I', '5639', 'p', '649', '535', 'k', '6621', 'j', '9539']

A: 44965
****
Q: 12, 16, ['8131', 'U', 'I', 'f', '8909', '1649', '2445', '4419', 'a', 'X', 'r', '1363', '2883', '6171', 'd', '113', '4149', '3339']

A:
10530
****