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:
2, 5, ['601', '9381', '2073', '5113', '9595', 'P', '9499', '7561', '9343']

Ex Output:
26162


Ex Input:
5, 16, ['a', '2439', 'p', '6759', 'z', '2233', 'q', '1447', 'Y', 'k', 'Y', 'Y', '4489', 'N', '5251', '5367']

Ex Output:
18787


Ex Input:
5, 21, ['R', '7377', 'G', 'i', 'b', '9617', '7157', '7049', '5255', '7581', '2415', '5021', 'g', 'e', '3097', 'Y', 'z', '7989', '5811', 'k', 'o']

Ex Output:

60992