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:
2, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']

Ex Output:
36626


Ex Input:
1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']

Ex Output:
12852


Ex Input:
5, 18, ['T', '9951', 'H', '5155', 'P', '4871', 'h', '7099', 'r', 'V', '5205', 'y', 'k', 'e', 'b', 'h', '3695', 'Y', 'h', 'j', '783']

Ex Output:

20870