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:
9, 13, ['x', '4589', 'q', 'X', 'Q', 'e', '8007', '5779', 'Z', '8503', 's', '6425', '133', '5389', 'e', '9477', '3763', 'Q', 'B', 'r', 'P']

Ex Output:
15061


Ex Input:
2, 5, ['8407', '1329', '2243', '2547', '5371', '6023', '7139', 'K', '339', '3301', '6771', 'Z', '9983', '17', 'V']

Ex Output:
11490


Ex Input:
1, 2, ['2541', 'j']

Ex Output:

2541