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, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']

Output: 9892


Input: Consider Input: 1, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']

Output: 37543


Input: Consider Input: 4, 8, ['1819', '5501', 'h', '3097', '3607', 'c', '1509', '3419', 'Z', '3017', 'G', '8079', '741', 'J', 'q', 'M', 'J', '4715', '7321', 'T', 'P', 'T']


Output: 11632