#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

ll dist_sq(pair<ll,ll> a, pair<ll, ll> b){
	ld dx = a.first-b.first;
	ld dy = a.second-b.second;
	return dx*dx + dy*dy;
}

int main() {
	ll n;
	cin>>n;
	ld r;
	cin>>r;
	ld r_sq = r*r;
	ll best_ans=0;
	vector<pair<ll,ll>> best_p;
	for(ll g=0;g<=n;g++){
		vector<pair<ll,ll>> planted;
		for(ll y=1;y<n;y++){
			for(ll x=1;x<n;x++){
				// check distance to boundary 
				ll b_dist = min({x,y,n-y,n-x});
				if((ld)b_dist<r) {
					// cout<<"SKIPPING "<<x<<" "<<y<<endl;
					continue;
				}
				// check distance to other planted trees
				ll p_dist_sq = n*n;
				ll mn_dx_same_row = 1e9;
				for(ll i=0;i<planted.size();i++){
					p_dist_sq = min(p_dist_sq, dist_sq({x,y},planted[i]));
					if(planted[i].second==y){
						mn_dx_same_row = min(mn_dx_same_row, x-planted[i].first);
					}
				}
				if(p_dist_sq<4*r*r) {
					// cout<<"TOO CLOSE "<<x<<" "<<y<<endl;
					continue;
				}
				if(mn_dx_same_row<(g+2*r)){
					// cout<<"FUCK "<<x<<" "<<y<<endl;
					// cout<<"mn_dx_same_row "<<mn_dx_same_row<<endl;
					continue;
				}
				planted.push_back({x,y});
			}
		}
		//cout<<"g: "<<g<<endl;
		//cout<<planted.size()<<endl;
		if(planted.size()>best_ans){
			best_ans = planted.size();
			best_p = planted;
		}
	}
	cout<<best_p.size()<<endl;
	for(ll i=0;i<best_p.size();i++){
		cout<<best_p[i].first<<" "<<best_p[i].second<<endl;
	}
}