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.

Example Input: 4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']
Example Output: 0

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

Example Input: 6, 14, ['s', 'g', '5997', 'A', '1133', 'p', '6999', '9351', 'W', '8617', '2519', '7813', 'z', '803', 'R', '3067', '6555', '8661', '1479', 'O', 'U', 'U', '3871', '2955', 't', '263', '3237', '2115']
Example Output:
36102