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:
5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

Ex Output:
29965


Ex Input:
14, 20, ['4221', '2381', 'i', 'm', 'c', 'F', '9703', '3529', 'a', '83', 'D', '1023', 'I', 'c', 'W', '7163', '341', 'w', '7855', '2317', '8989', '3629', 'b']

Ex Output:
17676


Ex Input:
1, 16, ['5541', 'm', 'B', '4311', '1473', '3707', 'A', '9285', '8009', '3337', 'R', '3305', 'C', '4721', 'N', '767', '1823', '8399', 'V']

Ex Output:

44456