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: 3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Output: 0


Input: Consider Input: 17, 22, ['4123', '6299', '2781', '759', 'f', 'A', 'X', '2549', 'K', '8119', '8725', 'e', 'I', 'S', '1429', 'd', '8051', 'Q', 'y', '1045', '763', 't', 'J', 'J', '169', 'b', '721']

Output: 9859


Input: Consider Input: 12, 22, ['d', 'V', 'E', 'v', 'v', '97', '3857', 'w', 'M', '3589', 'a', '7053', '9887', 'L', 'b', 'n', '2579', '5151', '1559', '715', '9853', 'S', '3161', 'x', 'u']


Output: 36797