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.

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

6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']
6313

3, 16, ['267', '6085', 'Z', 'b', '7793', 'K', '6577', 'G', '33', '1345', '2345', '5393', '2531', '761', 'N', '8671', '9777', 'D', 'a', '7159', '3467', '6969', 'k', 's', '2303', '4535', '4489']

35449