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:
4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']

Ex Output:
17103


Ex Input:
2, 5, ['9153', 'S', '605', '2951', 'I', 'o', '4995', '2895']

Ex Output:
3556


Ex Input:
6, 17, ['9327', '8505', '1849', '8119', 'M', 't', 'f', '5429', 'y', '4023', 'i', '669', '5837', 'n', 'w', '9417', '5485', 'M', '2289', 'r', '1689', '483', 'y', '1631', '4199', 'Y']

Ex Output:

30860