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: 4, 20, ['C', 'd', '9211', '6285', 't', '4685', '7175', 'P', 'l', 'r', '6779', '5561', 'w', 'w', '2381', '8273', '4645', '3565', 'B', 'C', '663', '9513', 'e', 'o', '1109', 'q', 'k', '4951', 'Q']

49349