Three Uneven Heaps

Three heaps of counters sit on a table. One heap contains 3 counters, another contains 4, and the last contains 5. You and an opponent alternate turns. On each turn, a player must choose exactly one heap and remove one or more counters from it. A player may empty a heap, but may not take counters from two different heaps during the same turn. The player who removes the final counter from the table wins. You move first, and your opponent will play perfectly. Only one opening move guarantees a win, and it takes counters from the heap of 3. How many counters must you take?