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:
4, 8, ['V', 'd', 'c', '9255', 'A', '2017', '4525', '4237']

Ex Output:
20034


Ex Input:
11, 12, ['5711', 'D', 'i', '9859', 'Z', 'g', '5943', 'X', '7095', 'Y', '1671', 'h', '7729', 'R', 'a', 'm', '8277', 'Q', '3215', 'A']

Ex Output:

1671