func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 61;   const int K = 22222;   const int M = K + K + 5;   int n, m;   int a[N], b[N];   long long m1[M], m2[M];   int main() {     scanf( %d %d , &n, &m);     for (int i = 0; i < n; i++) scanf( %d , &a[i]);     for (int i = 0; i < m; i++) scanf( %d , &b[i]);     for (int i = 0; i < n; i++) {       for (int j = 0; j < m; j++) {         m1[a[i] + b[j] + K] |= 1LL << i;         m2[a[i] + b[j] + K] |= 1LL << j;       }     }     int ans = 0;     for (int i = 0; i < n; i++) {       for (int j = 0; j < m; j++) {         for (int p = 0; p < n; p++) {           for (int q = 0; q < m; q++) {             int x = a[i] + b[j] + K;             int y = a[p] + b[q] + K;             int res1 = __builtin_popcountll(m1[x]) + __builtin_popcountll(m1[y]) -                        __builtin_popcountll(m1[x] & m1[y]);             int res2 = __builtin_popcountll(m2[x]) + __builtin_popcountll(m2[y]) -                        __builtin_popcountll(m2[x] & m2[y]);             ans = max(ans, res1 + res2);           }         }       }     }     printf( %d n , ans);     return 0;   }   