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, 14, ['7277', '3335', 'z', 'R', 's', '8267', 'q', '2743', 'w', '4003', 'G', 'O', 'Y', '4063', 'q', '7001', '7381', 'D', '6247', '7211', 'I', '2277', '7543', 'Y', '8243', '3127', 'V', '8709']

Ex Output:
4063


Ex Input:
2, 20, ['7991', '1029', 'L', '3307', 'A', '6641', '8833', 'J', '2751', '7457', 'f', '943', 'D', '5609', '5123', '5561', 'N', '1755', '1117', 'C', 'k', '6657', '2569']

Ex Output:
50126


Ex Input:
3, 6, ['1173', 'W', 'n', 'Z', '4011', '9057']

Ex Output:

13068