#include<bits/stdc++.h>
#define int long long
using namespace std;
int N,n,m;
vector<vector<int>> v;
void dfs(int now,vector<int> path){
if(now == N + 1){
v.push_back(path);
return;
}
for(int i = 1;i <= m;i++){
path.push_back(i);
dfs(now + 1,path);
path.pop_back();
}
}
signed main(){
cin >> n >> m;
N = n / (m + 1);
vector<int> path;
dfs(1,path);
if(n % (m + 1) == 0) cout << "second\n";
else{
cout << "first\n";
for(int i = 0;i < v.size();i++) cout << n % (m + 1) << " ";
cout << "\n";
}
for(int i = 0;i < N;i++){
for(int j = 0;j < v.size();j++) cout << v[j][i] << " ";
cout << "\n";
for(int j = 0;j < v.size();j++) cout << m + 1 - v[j][i] << " ";
cout << "\n";
}
return 0;
}
