Given a single letter from A to Z (except J and K) as input, output the smallest non-negative integer containing that letter in its written form. Assume numbers never contain the word "and", so
101 is "one hundred one", not "one hundred and one". Assume American (short-scale) counting, so one million is
10^6 and one billion is
a 1000 one thousand b 1000000000 one billion c 1000000000000000000000000000 one octillion d 100 one hundred e 0 zero f 4 four g 8 eight h 3 three i 5 five j k l 11 eleven m 1000000 one million n 1 one o 0 zero p 1000000000000000000000000 one septillion q 1000000000000000 one quadrillion r 0 zero s 6 six t 2 two u 4 four v 5 five w 2 two x 6 six y 20 twenty z 0 zero
J and K are not part of the input specification, so your behavior is undefined for them. Given one of the above letters, output the (decimal) number next to it. You can take input in lowercase or uppercase, but you cannot require that some inputs are lowercase and others uppercase.
This is code-golf, so the shortest answer in bytes wins.