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: 16, 29, ['235', 'N', 'h', 'E', '9109', '7383', '1547', '5155', 'q', 't', '1835', '1491', 's', 'p', '1129', '4173', '6505', 'F', 'L', '4251', '5957', 'D', 'y', 'c', 't', '2851', '943', 'c', '7077', '2935']

31757