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: Consider Input: 11, 27, ['1573', '6065', '869', '77', '9665', 'o', '8359', 'g', '3557', '521', '6797', '5117', '3921', '5707', 'k', '9855', '8415', 'Y', 'l', 'S', '385', '9063', '8975', '2047', 'H', 'p', 'p']

Output: 60282


Input: Consider Input: 7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']

Output: 0


Input: Consider Input: 11, 18, ['393', 'I', '9639', 'x', 'o', 'Q', 'V', 'W', '1329', '125', 't', 'O', 'm', '1151', 'k', 't', '6717', 'w', '2381', '9', 'd', 'a']


Output: 7868