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:
21, 27, ['2789', '3875', '2351', 'Y', '1127', 'J', 'Z', '5187', 'c', '8115', '3459', 'Y', 'f', 'o', 'L', 'H', '2931', '879', 'L', 'e', '3745', '173', 'v', 'W', '9393', 'Y', '7651']

Ex Output:
20962


Ex Input:
1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']

Ex Output:
19516


Ex Input:
9, 14, ['5317', 'r', 'a', 'S', '1693', '9383', '4935', '5511', '2637', 't', '259', 'm', '6147', '8205', '2743', 'M', 'W', 'A', 'N', '3537', '8133', '5213', '1247', '4757', '7205']

Ex Output:

17248