A letter lock consists of three rings each marked with thirteen different letters. The number of distinct unsuccessful attempts to open the lock is at the most ?
Choose the correct choice from the following answers:
A) 1773	B) 2196	C) 2153	D) 1683	E) 1673
Since each ring consists of thirteen different letters, the total number of attempts possible with the three rings is   = 13*13*13= 
<gadget id="calculator">13*13*13</gadget>
<output>2_197</output>
2197. Of these attempts, one of them is a successful attempt.   Maximum number of unsuccessful attempts= 2197 - 1= 
<gadget id="calculator">2197 - 1</gadget>
<output>2_196</output>
2196.   Answer: 2196
<result>B</result>
A letter lock consists of three rings each marked with thirteen different letters. The number of distinct unsuccessful attempts to open the lock is at the most ?