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:
1, 1, ['f', '6023', 'A', 'f', '4665', 'u', 'o', '7783', 'a', 'N', 'd', '7685', 'W', '9631', 'e', 'W', '1625', 'Q', 'B', '9097', '7613', 'L', '9929', '8469']

Ex Output:
0


Ex Input:
2, 5, ['5713', 'f', 'g', '9979', '2651', 't', '6513', 'v', '5733', '3325', 'M', 'B', '6139', 'n', 'K', 'h', 'c', '1181', '1263', '6625', 'F', '7059', 'c', '4083', 'i', 'g', '6783']

Ex Output:
12630


Ex Input:
1, 6, ['147', 'Z', '8683', '9819', 'F', '4123', 'b', '1099', 'w', 'S', '769', '7141']

Ex Output:

22772