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:
12, 17, ['k', '9879', 'R', '2595', 'c', 'p', '3825', 'y', 'i', '6281', '927', 's', '5407', '9137', 'F', '8207', 'L', 'I']

Ex Output:
22751


Ex Input:
4, 8, ['3573', '9813', '3867', 'i', '5291', '1987', '9811', 'A']

Ex Output:
17089


Ex Input:
1, 10, ['R', '7965', '3011', '9321', '4853', 'r', 'U', 'U', '5389', '3763', '417', '587', '3931', 'O', 'U', '8839', 'r', 'J', 'y', 'y', 'I', '8927', '3303', 'S', 'X', '6233', '4657', '7867']

Ex Output:

34302