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.

2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']
40773

6, 7, ['6947', 'l', 'd', '6531', 'X', 'l', '9741', '6553', '9905', 'n', 'Q', 'Y', '2063']
9741

9, 23, ['a', 'y', '3805', '1227', 'w', '1651', '2359', '4193', 'H', '489', '323', '2689', 'w', '5923', 'i', '5129', '6925', '285', 'Y', 'q', '5865', '3895', 'G', 'D', '9871', '6703', '4847', '8807', 'B']

31523