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, 11, ['4195', 'G', '3905', '8825', 'J', 'I', 's', 'd', '2681', 'g', '3873', 'N', '9349']
23479

6, 7, ['6997', '3987', '2463', 'm', 'W', 'R', 'a', 'U', 's', 'Y', 'X', '4193', '343', 'Y', '4277', 'n', 'W']
0

1, 8, ['q', 'W', '7815', '1143', '3915', 'Y', '4477', '8889', 'a', 'X', 'G', 'K', '4711', '9495', 'z', '8181', 'g', 'v', 'Q', '6825', '4433', '7659', 'H', '6285', '4251', '4661']

26239