public static void dfs(String temp, int n, boolean[] visited, int k) {
		if (temp.length() == n) {
			count++;
			result.add(new String(temp));
			return;
		}
		for (int i = 0; i < n; i++) {
			if (!visited[i]) {
				visited[i] = true;
				dfs(temp + (i + 1), n, visited, k);
				visited[i] = false;
			}
			// if (count == k)
			// break;
		}
	}