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:
1, 6, ['7349', 'S', '4839', 'R', '4443', '7569', '7307']

Ex Output:
24200


Ex Input:
7, 19, ['8309', 'O', '1491', 'k', '2521', '1161', 'y', '3215', '8345', '1949', '9883', 'g', 'z', 'B', 'S', 'j', 't', '2841', 'j', '3333', 'S', 'w', '2283', '793', 'w', 'q', 'p', 'J', '7979']

Ex Output:
26233


Ex Input:
6, 11, ['1205', 'K', 'o', '1493', 'P', 'v', '1271', 'r', '9683', 'k', 'N', '8233', '1165', '1165', '9193', 'd', '6965', '5059', '7361', '8371']

Ex Output:

10954