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: 11, 16, ['4897', '3585', '7531', 'B', '4295', 'n', 'M', '5381', 'L', '5887', '8015', 'e', '9913', 's', '2143', 'j', '5657', 'x', '1909', '7073', '9973', 'L', 'Q']

20071