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.

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']
317

2, 3, ['9773', 'e', 'G', 'm', '1859']
0

12, 15, ['E', '5773', 'H', 'T', '9019', '2069', '9149', '1619', '843', 's', '6519', 'X', 'u', 'i', '9149', 'q', '3901', '7897', 'H', 'L', 'Y', '6379', 'L']

9149