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.
21, 25, ['R', '3129', 'S', '747', '3307', '6769', 'i', 'e', 'G', '999', '927', '8459', '4785', '4255', 'E', 'g', '5897', '5107', 'Y', 'S', '6987', '3235', 'k', 'P', 'y']