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, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']

Ex Output:
19516


Ex Input:
3, 5, ['u', 'Y', '4165', '1421', '7617']

Ex Output:
13203


Ex Input:
6, 11, ['o', 'g', 'S', '8183', 'd', 'K', '2861', 'u', '8691', '5661', '3473', '3385', 'b', 'i', 'i', '7161', '8223', 'd', '1359', 'h', '4121', '8731']

Ex Output:

20686