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: 2, 20, ['S', '8919', 't', '7239', '3503', '6419', 'm', '8239', '2781', '8701', '6935', '9729', '5529', 'K', 'o', 'J', '7345', 'y', 'T', '6457', '1457', 'T', '4699', '6119', 'b', 't', '9853', '6263', '7665', 'w']

81796