最后一个点死活a不过去，求大佬指教

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
int sum = 0;
const char s[] = {'0', 'A', 'B', 'C'};
int m[64], p[64], n;
void move(int c, int b)
{
    int a ,l;
    if(b == p[c]) return;
    a = 6 - b - p[c];
    for(l = c - 1;l >= 1;l--) move(l,a);
    printf("move %d from %c to %c\n", c, s[p[c]], s[b]);
    p[c] = b;
    sum++; 
}
int main()
{
    scanf("%d", &n);
    int k, l;
    for(int i = 1;i <= 3;i++)
    {
        scanf("%d", &k);
        for(int j = 1;j <= k;j++)
        {
        scanf("%d", &l);
        p[l] = i;	
        }
    }
    for(int i = 1;i <= 3;i++)
    {
        scanf("%d", &k);
        for(int j = 1;j <= k;j++)
        {
            scanf("%d", &l);
            m[l] = i;
        }
    }
    for(int i = n;i >= 1;i--)
    move(i,m[i]);
    printf("%d", sum);
    return 0;
}