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:
11, 20, ['8031', 'v', 'p', '4015', 'v', '3299', '4143', '445', 'I', 'L', 'm', 'u', '7963', '8085', 'c', 'k', 'I', 'A', '8433', '1897', 'g', 'x', '5935', '5195', 'W', 'j', 'A']

Ex Output:
26378


Ex Input:
3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

Ex Output:
4477


Ex Input:
1, 5, ['O', 'o', 'F', 'K', '2725', '6547', '8893', '1921', '8781', 'Y']

Ex Output:

2725