#include<iostream>
#include<string>
using namespace std;
int data[7][7]={{0},{0,0,2,10,5,3,1000},{0,1000,0,12,1000,1000,10},{0,1000,1000,0,1000,7,1000},{0,2,1000,1000,0,2,1000},{0,4,1000,1000,1,0,1000},{0,3,1000,1,1000,2,0}};
int x,y;
int min_distance=1000;
int path[50];
int temp[50];
int len;
int visit[7]={0};
void dfs(int start,int cost,int p)
{
if(start==x)
{
if(cost<min_distance)
{
min_distance=cost;
for(int j=0;j<p;j++)
{
path[j]=temp[j];
}
len=p;
}
return;
}
for(int i=1;i<7;i++)
{
if(i==y||data[start][i]==1000)
{
// cout<<i<<"*"<<endl;
continue;
}
if(visit[i]==0)
{
visit[i]=1;
temp[p]=i;
dfs(i,cost+data[start][i],p+1);
visit[i]=0;//子树遍历完后要重置为0,以便分支的遍历
}
}
}
int main()
{
cin>>x>>y;
if(x==5)
{
cout<<0<<endl;
cout<<"[]"<<endl;
return 0;
}
if(y==x||y==5)
{
cout<<1000<<endl;
cout<<"[]"<<endl;
return 0;
}
temp[0]=5;
visit[5]=1;
dfs(5,0,1);
if(min_distance==1000)
{
cout<<1000<<endl;
cout<<"[]"<<endl;
return 0;
}
cout<<min_distance<<endl;
cout<<"["<<path[0];
for(int i=1;i<len;i++)
{
cout<<", "<<path[i];
}
cout<<"]"<<endl;
return 0;
}