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

int isPalindrome(char* s) {
    int len = strlen(s);
    for (int i = 0; i < len / 2; i++) {
        if (s[i] != s[len - 1 - i]) return 0;
    }
    return 1;
}

void toBaseK(int num, int base, char* result) {
    if (num == 0) {
        strcpy(result, "0");
        return;
    }
    char temp[100];
    int idx = 0;
    while (num > 0) {
        temp[idx++] = '0' + (num % base);
        num /= base;
    }
    for (int i = 0; i < idx; i++) {
        result[i] = temp[idx - 1 - i];
    }
    result[idx] = '\0';
}

int compare(const void* a, const void* b) {
    return (*(int*)a - *(int*)b);
}

int generatePalindromes(int* result, int limit) {
    int count = 0;
    
    // Single digit
    for (int i = 1; i <= 9 && count < limit; i++) {
        result[count++] = i;
    }
    
    // Multi-digit
    for (int length = 2; count < limit; length++) {
        int halfLen = (length + 1) / 2;
        int start = 1;
        for (int i = 1; i < halfLen; i++) start *= 10;
        int end = start * 10;
        
        for (int i = start; i < end && count < limit; i++) {
            char s[50];
            sprintf(s, "%d", i);
            char palindrome[100];
            strcpy(palindrome, s);
            
            if (length % 2 == 0) {
                for (int j = strlen(s) - 1; j >= 0; j--) {
                    strncat(palindrome, &s[j], 1);
                }
            } else {
                for (int j = strlen(s) - 2; j >= 0; j--) {
                    strncat(palindrome, &s[j], 1);
                }
            }
            result[count++] = atoi(palindrome);
        }
    }
    
    qsort(result, count, sizeof(int), compare);
    return count;
}

long long solution(int k, int n) {
    int palindromes[10000];
    int palCount = generatePalindromes(palindromes, n * 10);
    
    int count = 0;
    long long totalSum = 0;
    
    for (int i = 0; i < palCount && count < n; i++) {
        char baseKRepr[100];
        toBaseK(palindromes[i], k, baseKRepr);
        if (isPalindrome(baseKRepr)) {
            totalSum += palindromes[i];
            count++;
        }
    }
    
    return totalSum;
}

int main() {
    int k, n;
    scanf("%d", &k);
    scanf("%d", &n);
    printf("%lld\n", solution(k, n));
    return 0;
}