import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;


void main() {
    int y, b, r;
    scan(y, b, r);

    int ans = 0;

    foreach (i ; 1 .. y + 1) {
        foreach (j ; 1 .. b + 1) {
            foreach (k ; 1 .. r + 1) {
                if (j == i + 1 && k == j + 1) {
                    ans = max(ans, i + j + k);
                }
            }
        }
    }

    writeln(ans);
}






























void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}