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: 6, 8, ['x', 's', '1415', '6003', '2237', 'g', 'l', 'a', 'l', 'y', 'y', '4651', 'e', 'D', 'g']

Output: 0


Input: Consider Input: 4, 10, ['1081', 'm', 'm', '489', '9481', '5741', '1049', 'p', 'd', '7785', 'm', '4905', '1343', 'A', '9931', 'C', 'v', 'l']

Output: 24545


Input: Consider Input: 21, 29, ['Y', '1291', 'd', '2745', '6889', '2887', 'I', 'D', '1043', 'm', 'o', '9139', 'c', 'h', 'J', '8127', '229', '8059', 'a', '8531', '7707', '5223', 'L', '2609', 'k', 'T', '1133', 'u', 'w']


Output: 16672