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.

Ex Input:
3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']

Ex Output:
19477


Ex Input:
3, 4, ['1809', '1127', 'm', '3137']

Ex Output:
3137


Ex Input:
9, 14, ['J', 'v', 'f', 'd', '2817', '4837', 'F', '8559', '2405', 'D', '6787', '8723', '1749', 'A', '271', '8373', 'P', '1785', '879', 'h', 'p', 'B', '9371']

Ex Output:

19664