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.
13, 25, ['t', 'Q', 'n', 'o', 'G', '8303', '7805', '9913', '4275', '3821', '955', 'f', 's', 'T', 'g', '5269', '577', '6547', '5863', 'W', 'y', '3543', '3085', 'S', 'Y', '2731']