3 added 137 characters in body

The answer is no. Consider the family of groups $G_k:=(\mathbf Z_2{}^k)\rtimes \mathbf Z_2$, where the group on the right acts by interchanging the first and second coordinate. Then the commutator subgroup $G_k'$ is generated by $g_k:=((1,1,0,\ldots, 0),0)$, i.e. is of order two. So $G_k$ is non-abelian (of arbitrarily large order), but as little non-abelian as possible. Note that each element in $G_k$ has order dividing 4.

Now let $A=\lbrace a_1,\ldots, a_n \rbrace \subseteq G_k$. Then any element in $A^m$ can be written as $a_1^{e_1} \cdots a_n^{e_n} g_k^{e_k}$, where $0\leq e_i \leq 3$ for $i=1,\ldots n$ and $e_k=0,1$. This follows by applying the identity $ab=[a,b]ba$ repeatedly. In particular, $|A^m|$ is bounded by a constant depending on $n$ only, not on $m$.

Edit: To be explicit, any two elements in $G_k$ will generate a subgroup of order at most 32, so $(n,m)=(2,31)$ is one counter-example.

Post Undeleted by Guntram
2 added 214 characters in body

The answer is no. Consider the family of groups $G_k:=(\mathbf Z_2{}^k)\rtimes \mathbf Z_2$, where the group on the right acts by interchanging the first and second coordinate. Then the commutator subgroup $G_k'$ is generated by $((1,1,0,\ldots, g_k:=((1,1,0,\ldots, 0),0)$, i.e. is of order two. So $G_k$ is non-abelian (of arbitrarily large order), but as little non-abelian as possible.

From $ab=[a,b]ba$ it follows Note that for a subset each element in $A\leq G_k$ of cardinality $n$, has order dividing 4.

Now let $|A^m|\leq 2\cdot A=\lbrace a_1,\ldots, a_n \binom{n}{m}$. Choosing rbrace \subseteq G_k$. Then any element in$n,m$such that A^m$ can be written as $2\cdot {n a_1^{e_1} \choose m}\leq cdots a_n^{e_n} g_k^{e_k}$, where $0\leq e_i \binom{n+m-1}{m}$ implies leq 3$for$i=1,\ldots n$and$e_k=0,1$. This follows by applying the claimidentity$ab=[a,b]ba$repeatedly. In particular,$|A^m|$is bounded by a constant depending on$n$only, not on$m\$.

Post Deleted by Guntram
1