<p>The set <code>[1, 2, 3, ...,&nbsp;n]</code> contains a total of <code>n!</code> unique permutations.</p>

<p>By listing and labeling all of the permutations in order, we get the following sequence for <code>n = 3</code>:</p>

<ol>
	<li><code>&quot;123&quot;</code></li>
	<li><code>&quot;132&quot;</code></li>
	<li><code>&quot;213&quot;</code></li>
	<li><code>&quot;231&quot;</code></li>
	<li><code>&quot;312&quot;</code></li>
	<li><code>&quot;321&quot;</code></li>
</ol>

<p>Given <code>n</code> and <code>k</code>, return the <code>k<sup>th</sup></code> permutation sequence.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> n = 3, k = 3
<strong>Output:</strong> "213"
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> n = 4, k = 9
<strong>Output:</strong> "2314"
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> n = 3, k = 1
<strong>Output:</strong> "123"
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 9</code></li>
	<li><code>1 &lt;= k &lt;= n!</code></li>
</ul>

class Solution:
    def permute_naive(self,data, i, length,result:List[int]):
        if i == length:
            result.append(''.join(data))
        else:
            for j in range(i, length):
                data[i], data[j] = data[j], data[i]
                self.permute_naive(data, i + 1, length,result)
                data[i], data[j] = data[j], data[i]
        return result
    def getPermutation(self, n: int, m: int) -> str:
        arr=[]
        for k in range(1,n+1):
            list_arr =[str(k) for k in range(1,n+1)]
            item = list_arr[k-1]
            list_arr.remove(item)
            temparr= self.permute_naive(list_arr,0,n-1,[])
            for l in range(len(temparr)):
                temparr[l] = str(k)+temparr[l]
            arr+=temparr 
        arr.sort()
        return arr[m-1]
43100