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: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']

Output: 6095


Input: Consider Input: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']

Output: 1937


Input: Consider Input: 18, 28, ['f', 'v', '4909', '2989', 'o', '8767', 'k', 'p', '9561', '2439', 'A', '1391', 'q', 'g', 'u', 's', 's', '9585', '7915', '3139', '8305', 'u', 'G', '5893', '7439', '4943', 'k', 'K', '1993', 'O']


Output: 47219