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:
4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']

Ex Output:
13650


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:
8, 25, ['4979', '2257', 'c', 'q', 'r', '7547', 'j', '8917', 'S', '8139', '1007', '9799', '4321', '8545', '9143', 'C', 'C', 'p', '1153', 'K', '747', 'e', '4661', 'R', 'e', '8373']

Ex Output:

56432