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: 10, 15, ['n', '4807', 'a', 'Q', '3781', 'h', '1553', 'n', 'J', 'L', 'M', '3781', '6375', '2429', 'O', '1687', 'L', 'S', '607', '9433']

Output: 12585


Input: Consider Input: 9, 13, ['2813', 's', 'z', 'G', '5927', '4415', 'T', 'c', '7029', 'e', 'o', 'd', '5913', 'y']

Output: 12942


Input: Consider Input: 4, 10, ['2335', '3347', 'w', '8321', '9709', '493', '3567', 'o', 'X', '723', 'g', 'G', '7301', '4985']


Output: 22813