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.
8, 11, ['c', '8283', '1909', 'l', 'b', 'f', '4137', 'k', 'm', '1961', 'H', '3395', '1', '4041', 'k', 'v', 'h', '6319', '4903', 'P', 'N', '9257', 'p', 'v']