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, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']

Ex Output:
7479


Ex Input:
5, 12, ['2653', 'A', '4739', '149', 'J', '817', 'n', '9589', '965', '1545', 'r', '9061', '7973', '5769', 'Y', '5889', 'A', 'P', '5789', '9757']

Ex Output:
21977


Ex Input:
3, 18, ['5665', 'C', 'x', '9435', 'x', 'b', '3861', 'f', '8231', 'Q', 'd', '6271', 'o', '6095', 'j', '5783', 'J', 'v', '9113', '8175', '1783', 'P', '6657', 'N', 'f', 'w']

Ex Output:

39676