1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef pair<int, int> pii;

int n, k, mod;
vector<int> ciag;
int res = 0;


bool chk()
{
    int siz = ciag.size();
    vector<bool> wywalony;
    wywalony.resize(siz);

    int time = 0;

    while(siz > 1)
    {
        /*for(int i=0; i<wywalony.size(); i++)
        {
            cout << wywalony[i] << " ";
        }
        cout << "\n";*/
        //cout << time << "\n";

        pii last = pii(-1, 0);
        time++;

        for(int i=0; i<ciag.size(); i++)
        {
            if(!wywalony[i])
            {
                if(ciag[i] < last.first)
                {
                    wywalony[i] = true;
                    siz--;
                }
                else if (last.first != -1 && !wywalony[last.second])
                {
                    wywalony[last.second] = true;
                    siz--;
                }

                last = pii(ciag[i], i);   
            }
            //cout << "here\n";
        }
    }
    //cout << time << "\n";

    return time == k;


}

void displayCiag()
{
    for(int i=0; i<ciag.size(); i++)
    {
        cout << ciag[i] << " ";
    }
    cout << "\n";

    return;
}

void permut(int pocz, int kon)
{
    if(pocz == kon)
    {
        //displayCiag();
        if(chk())
        {
            //displayCiag();
            res++;
            return;
        }
    }

    for(int i=pocz; i <= kon; i++)
    {
        swap(ciag[pocz], ciag[i]);
        permut(pocz+1, kon);
        swap(ciag[pocz], ciag[i]);
    }
}



int main()
{
    ios_base::sync_with_stdio(0);

    cin >> n >> k >> mod;

    for(int i=1; i <= n; i++)
    {
        ciag.push_back(i);
    }

   

    permut(0, n-1);

    cout << res % mod << "\n";

    return 0;
}