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: 12, 14, ['2579', '1171', '1879', '351', '4515', '8357', 'S', '2789', '2257', '7577', 'M', '2067', 'L', 's', '801', '6009', '987', 'i', 'x', 'o', 'p', '8501', 'v', '451', '3805', 'h', 'Q', 'D', '5129', '1301']

2067