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:
3, 5, ['i', 'e', '6583', '313', '5511']

Ex Output:
12407


Ex Input:
5, 10, ['8553', '4157', 'm', 'Q', 'u', 'j', 'X', 'r', '8579', '255', 'A', 'g', '7017', '5707', 'd', 'O', 'V', 's', 'p', '337', 'F', '5439', '5715', 'c', '2615', 'l', '3537']

Ex Output:
8834


Ex Input:
18, 22, ['E', 'I', '7677', 'H', 'c', '5361', '3707', 'u', 'q', '1621', 'E', '5435', '7927', 'i', '1205', '5003', 'w', 'n', '9651', 'y', 'P', '3165', '8945', 's', '9425']

Ex Output:

12816