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.

Q: 16, 17, ['5985', '1925', 'r', 'H', 'p', 'L', '5019', 'y', 'O', '6575', '9729', 'S', '2497', '43', 'u', '317', 'p', '3043', '3247', 'z', 'O', '8379', '7715', '8399']

A: 317
****
Q: 14, 17, ['Q', '7681', '8379', '2569', 'D', '5179', 'M', 'M', 'k', '187', '9275', 'V', 'L', 'F', '6397', '6385', 'O', '4823', '8655']

A: 12782
****
Q: 2, 8, ['6687', '6745', '1257', 'K', '845', 't', '9721', '4151', '9437', '13', '6819', 'M', 'z', 'Y', 'e']

A:
22719
****