# Largest Number Possible After At Most K Swaps

easy

1. You are given a string which represents digits of a number. 2. You have to create the maximum number by performing at-most k swap operations on its digits. Note -> Check out the question video and write the recursive code as it is intended without changing signature. The judge can't force you but intends you to teach a concept.

## Constraints

1 <= length of S <= 30 1 <= K <= 10

## Format

### Input

A string S and a number K

### Output

A number

## Example

Sample Input

1234567
4

### Sample Output

7654321

Question Video