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: 2, 22, ['Y', '203', 'i', 'b', '2019', '7785', 'u', '9161', 'k', '6543', 'h', '5221', 'Z', 'i', 'B', '4521', 'I', 'Z', '4959', '8841', 'd', 'p', 'i', 'R', 's', '7297', 'y']

Output: 49253


Input: Consider Input: 1, 2, ['5605', '6415']

Output: 12020


Input: Consider Input: 5, 19, ['m', '9007', '1399', '1055', 'd', 'b', 'y', '4803', '5867', '7733', '6049', 'r', '9007', 'S', '3499', '9293', 'q', 'v', '1017', 'V', 'A', '2825', '3307']


Output: 47268