소수 만들기

class Solution {
    public int solution(int[] nums) {
        int answer = 0;
        int i, j, k, l, m;
        int s1 = 0, s2 = 0, s3 = 0;
        
        for (i = 0; i < nums.length; i++) {
            s1 = nums[i];
            for (j = i + 1; j < nums.length; j++) {
                s2 = s1 + nums[j];
                for (k = j + 1; k < nums.length; k++) {
                    s3 = s2 + nums[k];
 
                    m = (int) Math.sqrt(s3);
                    for (l = 2; l <= m; l++) {
                        if (s3 % l == 0)
                            break;
                    }
                    if (l == m + 1)
                        answer++;
                }
            }
        }
 
        return answer;
    }
}