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.
15, 22, ['J', '4995', 'c', 'x', '6981', '1197', '217', '7819', '9859', '7761', 'p', '3099', 'C', '7623', '4365', '8041', '3547', '8751', 'G', '3669', '7039', 'v', 'r']