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.

4, 10, ['B', 'b', '6741', '9121', 'N', '2871', 'Z', '1685', '995', '8681', '8591', 'z', '7423', '8661', 'R', 'b', 'g', 'Z', '5679', '4217', 'h', '8497', '3261', '6891', '2145', 'Y']
23353

10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']
1739

14, 15, ['j', 'M', 's', 'd', '7769', '4417', 'd', '9391', 'I', '283', 'K', 'E', '4925', '2391', '319', '5643', '5313', '9525', '2281', 'G', 'X', 'P', '245', 'z', '4559', 'i', 'v', '5953', 't']

2710

