(I2
I133
I6
(dp0
Vtable.%l
p1
(Vtable_variations.cpp
p2
S"#include<iostream>\r\n#include<algorithm>\r\nusing namespace std;\r\nint n,m,k,t[72],a[42],b[42],used[72],ans;\r\nvoid var2 (int pos)\r\n{\r\n    if (pos==2*n)\r\n    {\r\n        int j=0,l=0;\r\n        for (int i=0; i<n; i++)\r\n            if (t[i]==a[j])\r\n                j++;\r\n        if (j==m)\r\n        {\r\n            for (int i=n; i<2*n; i++)\r\n                if (t[i]==b[l])\r\n                    l++;\r\n            if (l==k)\r\n            {\r\n                ans++;\r\n            }\r\n        }\r\n        return;\r\n    }\r\n    for (int i=t[pos-1]+1; i<=2*n; i++)\r\n    {\r\n        if (i>t[pos-n] && !used[i])\r\n        {\r\n            used[i]=1;\r\n            t[pos]=i;\r\n            var2(pos+1);\r\n            used[i]=0;\r\n        }\r\n    }\r\n}\r\nvoid var1 (int pos)\r\n{\r\n    if (pos==n)\r\n    {\r\n//        for (int i=0; i<n; i++)\r\n//            cout<<t[i]<<' ';\r\n//        cout<<'\\n';\r\n        for (int i=t[0]+1; i<=n+1; i++)\r\n        {\r\n            if (used[i])\r\n                continue;\r\n            used[i]=1;\r\n            t[n]=i;\r\n            var2(n+1);\r\n            used[i]=0;\r\n        }\r\n        return;\r\n    }\r\n    for (int i=t[pos-1]+1; i<=2*n; i++)\r\n    {\r\n        used[i]=1;\r\n        t[pos]=i;\r\n        var1(pos+1);\r\n        used[i]=0;\r\n    }\r\n}\r\nint main()\r\n{\r\n    ios::sync_with_stdio(false);\r\n    cin.tie(NULL);\r\n    cin>>n>>m;\r\n    for (int i=0; i<m; i++)\r\n        cin>>a[i];\r\n    sort(a,a+m);\r\n    cin>>k;\r\n    for (int i=0; i<k; i++)\r\n        cin>>b[i];\r\n    sort(b,b+k);\r\n    for (int i=1; i<=n+1; i++)\r\n    {\r\n        used[i]=1;\r\n        t[0]=i;\r\n        var1(1);\r\n        used[i]=0;\r\n    }\r\n    cout<<ans<<'\\n';\r\n    return 0;\r\n}\r\n"
p3
tp4
stp5
.