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.

Ex Input:
6, 12, ['q', '8055', '5233', '5529', 'T', 'h', 'w', 'w', '9449', 'W', '7903', 'b', '6925']

Ex Output:
17352


Ex Input:
5, 6, ['937', '3595', '1279', '8705', '3587', '5879']

Ex Output:
9466


Ex Input:
9, 17, ['Z', '6977', 'n', 'M', '4505', '9421', '9087', 'm', 'K', 'i', 'r', '9351', '9329', '4563', 'Z', '6811', '8119', 'U', 'q', '6601', 'Z', 'c', 'o', 'v', '2507', 'j']

Ex Output:

38173