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:
11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']

Ex Output:
4918


Ex Input:
1, 2, ['j', '3613']

Ex Output:
3613


Ex Input:
2, 14, ['e', 'Y', 'P', '9271', 'L', '1557', 'z', '7675', '2041', '6855', 'r', '4107', 'X', '7355', '8299', 'X']

Ex Output:

38861