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:
1, 2, ['4001', 'e', 'm', 'Q', 'T', 'a', '2909', '4043', 'O', 'L', '3401', 'Y', '4015', '2045', '3881', 'd']

Ex Output:
4001


Ex Input:
1, 5, ['5057', 'Z', 'a', '4561', '225', '6921', 'T', '4033', '1259', '9805', 'l', '5641']

Ex Output:
9843


Ex Input:
1, 5, ['3651', 'Y', 'r', 'Y', '8187', 'b', '6297', '7827', 'D', 'u']

Ex Output:

11838