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: 7, 20, ['X', '2589', 'p', '1719', 'm', 'x', '8761', '4649', 'D', '8655', '2731', 'm', '3461', 'k', 't', 'Q', 'm', '8877', 'e', 'c', '1195', '4363', '3405', 'k', '2817', 'o', '5937', '649', '9053', 'h']

37134