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:
3, 4, ['u', '5041', 'E', 'U', 'a', 'd']

Ex Output:
0


Ex Input:
11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']

Ex Output:
26471


Ex Input:
6, 22, ['i', 'p', 'Z', '7255', 'I', '2377', 'b', '7659', '189', '1691', '1489', '6081', '5649', 'V', 'j', 'e', 'K', 'U', 'z', 'j', 'X', 'k', '7579', '645', '8045', 'r', 'C', '4265', '7389']

Ex Output:

25135