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: 2, 20, ['7051', 'B', 'Q', '7859', '1517', 'f', 'l', 'U', '4791', 'E', 'y', 'v', '7513', 'G', 'n', '241', 'I', 'v', 'K', '9781', 'q', 'z', 'y', 'd', '2533', '8645', 'm', '7073', 'f', '6189']

31702