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:
5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

Ex Output:
7896


Ex Input:
16, 22, ['F', '197', '9799', 'W', '9967', 'V', '9955', '5143', 't', 'f', '749', 'N', 'b', '8049', 'W', '6835', '8007', 'm', '7233', 'B', 'I', '599', '6101', 'G', 'i', '2271', 'h', 'P']

Ex Output:
22674


Ex Input:
2, 16, ['3989', 'h', '2759', '2021', '9619', 'v', 'G', '3517', '2803', 'F', '9427', 'g', 'i', 'y', '9765', 'g', '7367', '7941', '2767', '6335']

Ex Output:

39911