/*
[arc104] D - Multiset Mean
*/

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
#define ALL(c) (c).begin(), (c).end()

const int MAX_N = 100;
const int MAX_K = 100;
const int MAX_S = MAX_N * MAX_N * MAX_K;

int N, K, MOD;

class gf {
public:
    int n;
    gf() : n(0) {}
    gf(int n) : n(n < 0 ? n % MOD + MOD : n % MOD) {}
    gf operator+(gf x) { return gf((n + x.n) % MOD); }
    gf operator-(gf x) { return gf((n - x.n + MOD) % MOD); }
    gf operator*(gf x) { return gf((1LL * n * x.n) % MOD); }
    gf& operator+=(gf x) { return *this = (*this + x); }
    gf& operator-=(gf x) { return *this = (*this - x); }
    gf& operator*=(gf x) { return *this = (*this * x); }
};

gf dp[MAX_N + 1][MAX_S + 1];

void solve() {
    int sz = 0;
    dp[0][0] = 1;
    for (int i = 1; i <= N; i++) {
        sz += i;
        gf ps[MAX_N + 1];
        for (int j = 0; j <= sz * K; j++) {
            int m = j % i;
            ps[m] += dp[i - 1][j];
            int lj = j - i * (K + 1);
            if (lj >= 0) {
                ps[m] -= dp[i - 1][lj];
            }
            dp[i][j] = ps[m];
        }
    }

    for (int i = 1; i <= N; i++) {
        gf ans = 0;
        for (int j = 0; j <= sz * K; j++) {
            ans += dp[i - 1][j] * dp[N - i][j];
        }
        ans = ans * (K + 1) - 1;
        cout << ans.n << endl;
    }
}

int main() {
    cin >> N >> K >> MOD;

    solve();

    return 0;
}

#include <bits/stdc++.h>

#pragma GCC optimize(2)
using namespace std;
#define int long long
typedef long long LL;
typedef long long ll;
const int INF = 0x3f3f3f3f;
//const int inf = 1e18;
//const int mod = 998244353;
const int mod = 1e9 + 7;
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
const int maxn = 1e6 + 10;
const int N = 6e6 + 100;

int a[maxn];

void solve() {
    int r,x,y;
    cin>>r>>x>>y;
    double R=sqrt(x*x+y*y);
    if (R<r) cout<<2<<"\n";
    else 
    cout<<ceil(R/(r*1.0))<<"\n";
}

signed main() {
    //ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
//    cin >> _;
    while (_--) {
        solve();//cout<<"\n";
    }
    return 0;
}


