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:
10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']

Ex Output:
12585


Ex Input:
9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

Ex Output:
8357


Ex Input:
1, 16, ['n', '3985', 'J', 'G', 'V', 'z', 'z', 'B', '6973', 'g', 'i', 'i', 'J', 'A', '8369', '9101', '7987', '2243', 'L', '4973', 'r', '8561', 'o', '5979']

Ex Output:

28428