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.
7, 22, ['v', 'P', 'n', 's', '3157', 'J', 'P', '2479', '7635', '7485', 'j', '2047', 'P', 'y', '411', '1789', '9301', '5781', 'J', 'o', 'P', 'H', 'm', 'f', 'J', 'z', '7647', '2653', '8395']