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:
2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']

Ex Output:
18160


Ex Input:
1, 3, ['Z', 'X', 't']

Ex Output:
0


Ex Input:
17, 22, ['J', 'b', '8559', '9963', 'G', '3085', '989', 'D', 't', 'D', 'T', '3329', '5075', '895', 'D', '2663', 'd', 'U', '4663', '7935', 'z', 'V', '6495', 'E', '4029', '6951', 'w', '6843', 'O']

Ex Output:

12598