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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Ex Output:
1351


Ex Input:
1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']

Ex Output:
67809


Ex Input:
1, 10, ['h', '1279', '7797', 'C', '6493', 'J', 'n', 'z', 'c', '4773', 'I', 'B', 'y', '2843', '1759', '591']

Ex Output:

20342