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, 3, ['3335', '3451', 'f', 'M']

Ex Output:
3451


Ex Input:
3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']

Ex Output:
283


Ex Input:
4, 16, ['V', '9437', 'p', 'G', '4639', 'k', '6799', 'd', 'l', 'X', '5707', 'E', 'b', 'o', '6613', 'z', '7353', '4813']

Ex Output:

23758