// Ackermann function benchmark - deep recursion
#include <stdio.h>
#include <stdint.h>

int64_t ack(int64_t m, int64_t n) {
    if (m == 0) return n + 1;
    if (n == 0) return ack(m - 1, 1);
    return ack(m - 1, ack(m, n - 1));
}

int main() {
    int64_t result = ack(3, 10);
    printf("ack(3,10) = %ld\n", result);
    return 0;
}