Definition: 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.
Input: 15, 16, ['T', '3315', '8497', 'H', 'R', 'K', 'u', '919', '2193', '2957', '3051', '7899', 't', '7815', 'c', '8567', '7065', '4293']

8567