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:
12, 24, ['4727', 'q', 'L', '969', '6799', '6223', '8967', 'e', '8589', '4399', '3237', 'M', '5323', '1477', 'n', '1553', 'r', 'J', '4789', 'h', 'J', 'M', 'g', 's', 'N', 'O']

Ex Output:
13142


Ex Input:
16, 21, ['5919', 'o', '8457', '1795', 'x', 'X', 'z', 'j', 'v', '8703', 'b', 'n', '353', 'k', 'B', 'B', '6969', 'e', '8761', 'W', 'h']

Ex Output:

15730