Definition: 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: 2, 9, ['X', '6963', 'P', '9183', '5861', '9381', 'A', 'k', 'Z', '8583', '7351', 'G', 'k', 'p', 'x', 'z', 'C', 'z', 'k', '2777', '4351', 'C']

31388