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:
1, 5, ['V', '9481', '9901', '7235', '5281', '2719']

Ex Output:
31898


Ex Input:
19, 19, ['j', '2945', '5185', 'l', 'M', '4339', '4587', 'u', 'G', 'w', '717', '3947', '6077', '2369', 'p', '9599', '1433', 'n', '8229', '6003', 'X', '925']

Ex Output:

8229