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, 12, ['h', 'C', 'q', '7869', 'S', '2545', '3607', '8257', '165', '6373', 'X', '2481', 'a', '5803', '9191', 'v', 'c', 'k', '8077']

Output: 8854


Input: Consider Input: 4, 4, ['2107', 'l', '7551', '4907']

Output: 4907


Input: Consider Input: 5, 18, ['Y', '4005', '1167', 'n', 'P', '6791', 'u', 'E', 'j', '7463', '3693', 'R', '2583', '5095', '8463', '6431', 'o', '3501', 'f', '7117', '837', 'l', 'd', '6913', '9173', 'q', '2409', '383']


Output: 44020