#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<ll, ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define repb(i, a, b) for(ll i = (b) - 1; i >= (a); i--)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size()

ll read_double() {
    ll x, y;
    char c;
    cin >> x >> c >> y;
    if (y)
        while (y < 100)
            y *= 10;
    return x * 1000 + y;
}

vector<pii> helper(ll n, ll r, ll gah, ll gah2) {
    ll nn = 1000 * n;
    vector allowed(n+1, vector<char>(n + 1, true));
    vector<pii> out;
    gah *= 1000;
    gah2 *= 1000;
    if (gah < r || gah2 < r || nn - gah < r || nn - gah2 < r) return {};
    out.emplace_back(gah / 1000, gah2 / 1000);
    rep(k,0,n+1) rep(k2,0,n+1) {
            ll kx = 1000 * k, ky = k2 * 1000;
            if ((kx-gah)*(kx-gah)+(ky-gah2)*(ky-gah2) < (4 * r * r))
                allowed[k][k2] = false;
        }


    rep(i,0,n+1) rep(j,0,n+1) {
            if (!allowed[i][j]) continue;
            ll x = i * 1000, y = j * 1000;
            if (x < r || y < r || nn - x < r || nn - y < r) continue;
            out.emplace_back(i, j);
            rep(k,0,n+1) rep(k2,0,n+1) {
                    ll kx = 1000 * k, ky = k2 * 1000;
                    if ((kx-x)*(kx-x)+(ky-y)*(ky-y) < (4 * r * r))
                        allowed[k][k2] = false;
                }
        }
        return out;
}

void solve() {
    ll n;
    cin >> n;
    ll r = read_double();
    vector<pii> bst;
    rep(i,0,n+1) rep(j,0,n+1)  {
        auto gah = helper(n, r, i, j);
        if (ssize(gah) > ssize(bst))
            bst = gah;
    }
    cout << ssize(bst) << '\n';
    for (auto [x, y] : bst)
        cout << x << ' ' << y << endl;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    //ll t; cin >> t; while(t--)
        solve();
}