N3

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

int n, M, pM, toh;
vector <int> to(int x) {
    vector <int> r;
    while (x > 0) {
        r.pb(x % 26);
        x /= 26;
    }
    while (r.size() < n) r.pb(0);
    return r;
}

int f(vector <int> a) {
    int h = 0;
    for (int i = 0; i < n; ++i) {
        h = ( (h * 57) xor (a[i] + 1))  % pM;
    }
    return h;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ans = 0;
    cin >> n >> M >> toh;
    pM = pow(2, M);
    for (int i = 0; i < pow(26, n); ++i) {
        auto v = to(i);
        if (f(v) == toh) {
            ans++;
        }
    }
    cout << ans;
}