#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';
}

long long solution(int k, int n) {
    int count = 0;
    int num = 1;
    long long totalSum = 0;
    
    while (count < n) {
        char base10[100];
        sprintf(base10, "%d", num);
        
        // Check if palindrome in base 10
        if (isPalindrome(base10)) {
            // Check if palindrome in base k
            char baseKRepr[100];
            toBaseK(num, k, baseKRepr);
            if (isPalindrome(baseKRepr)) {
                totalSum += num;
                count++;
            }
        }
        num++;
    }
    
    return totalSum;
}

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