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.

7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
5121

3, 4, ['F', '7341', 'P', '3315']
3315

2, 17, ['3719', '1065', 'C', '9525', '1239', '9761', '623', '99', 'M', 'g', '5247', 'R', 'D', '7339', 'Y', '7019', '1447', '2083', '5531', '9389', '4125', 'T']

43364