#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void swap(char* a, char* b) {
    char temp = *a;
    *a = *b;
    *b = temp;
}

int countSwaps(char* from, char* to, int len) {
    char* current = malloc((len + 1) * sizeof(char));
    strcpy(current, from);
    int swaps = 0;
    
    for (int i = 0; i < len; i++) {
        if (current[i] != to[i]) {
            int j = i + 1;
            while (j < len && current[j] != to[i]) {
                j++;
            }
            
            while (j > i) {
                swap(&current[j], &current[j-1]);
                swaps++;
                j--;
            }
        }
    }
    
    free(current);
    return swaps;
}

// Simplified version for demonstration
int getMinSwaps(char* num, int k) {
    // This is a simplified version
    // Full implementation would require complex permutation generation
    int len = strlen(num);
    
    // For demo purposes, simulate finding kth permutation
    char target[20];
    strcpy(target, num);
    
    // Apply next permutation k times (simplified)
    for (int i = 0; i < k; i++) {
        // Simple increment for demo
        target[len-1]++;
    }
    
    return countSwaps(num, target, len);
}

int main() {
    char num[20];
    int k;
    
    fgets(num, sizeof(num), stdin);
    scanf("%d", &k);
    
    // Remove newline and quotes
    num[strcspn(num, "\n")] = 0;
    if (num[0] == '"') {
        memmove(num, num + 1, strlen(num));
        num[strlen(num) - 1] = 0;
    }
    
    printf("%d\n", getMinSwaps(num, k));
    return 0;
}