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, 13, ['n', '6159', '8359', 'u', '2065', 'T', 'k', '6337', '7731', '7747', '1101', '9243', 'h', '7243', 'v', 'K', '9235', 'o', '9369', 'o', 'S', 'B', '7183', 'N']

48742