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: 9, 15, ['9375', '9663', 'i', '9607', '4257', '9757', 'r', '937', 'm', 's', '9193', '2269', '4627', '2051', '7045']

A: 25185
****
Q: 1, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']

A: 23479
****
Q: 2, 13, ['A', 'K', 'k', '9247', '8199', 'F', '7741', '4479', '4787', 'o', '9719', 'G', 'I']

A:
44172
****