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, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
16174

13, 16, ['R', '3701', 'k', 'p', 'g', '4317', 'Z', 'o', 'g', '1211', 'w', '6641', 'E', '6343', '6275', '4883', '4135', '9843', '3755', 'X', '1381', '9269']

17501