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:
5, 6, ['3087', '7917', 'M', '4557', '4409', 'N', '1843', 's', '1883', 'L', '315', '9983', 'n', 'H', 't', '4419']

Ex Output:
4409


Ex Input:
2, 12, ['w', 'T', '7611', '617', '1891', '8259', '1207', 'f', '4927', 'N', 'M', '9163', 'v', '3019', '3993', 'w', 'z', 'i', '3599', 'S', 'i']

Ex Output:

33675