function code = m21_bestCode22(R,t,data)
tCs = [9 6 3 0 6 9];
u = [];
v = [];
%% 获取即将到达1位置上的车辆
for j=1:size(R,1)
    area = R(j,end);
    lane = floor(area/10);
    place = area-10*lane;
    if place ==1 && lane~=0
        if R(j,t+tCs(lane)) == str2double([num2str(lane) num2str(1)])
            v = [v j];
        end
    end
end

if size(v,2)==0
    code = 13;
else
    code = m23_findBestCode1(v,R,data);
end
end