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:
6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']

Ex Output:
17352


Ex Input:
3, 5, ['c', '9619', 'e', 'A', '5045', '2453', 'L', '553', '5493', '5657']

Ex Output:
5045


Ex Input:
6, 6, ['s', '1027', 'P', 'o', '5037', '3571', 'Q', 'R', 'G', 'g', '8873', '2085', '2949', '7241']

Ex Output:

3571