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, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']

Ex Output:
0


Ex Input:
2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

Ex Output:
12269


Ex Input:
7, 24, ['D', '8859', 'd', '2405', 'a', '3657', '1465', 'o', 'Q', '2329', 'l', '5903', '4647', '1729', 'n', 'k', '187', 'u', 'Y', '2785', '2709', '9385', 'g', '6829', 'I', 'W']

Ex Output:

37968