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, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']

Output: 129


Input: Consider Input: 7, 10, ['7583', 'a', '6095', '4215', 'r', 'T', 'l', '6321', '3009', '3909', 'A', '613', 'O', 'p', 's', 'a']


Output: 13239