Series-HackerOne

package com.deep;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    int t = scanner.nextInt();
    for(int i=1;i<=t;i++){
        int sum =0;
        int[] intArray = {0,0};
        int m = scanner.nextInt();
        int k = scanner.nextInt();
        int store=0,x=0,y=0;
        for(int j=1;j<=m;j++){
            x = scanner.nextInt();
            y = scanner.nextInt();
            if(j==1){
                intArray[0] = y;
                store = x;
            }
            if(j==2){
                intArray[1] = y;
            }
            sum +=y;
        }
        int difference = intArray[1] - intArray[0];
        if(difference<0){
            difference = difference * (-1);
        }
        int start = 0;
        if(difference%2!=0){
            start=1;
        }
        for(int p =1,q=start;p<store;p++,q++){
            sum+= (q*difference);
        }
            for(int a=m+1;a<=k;a++,x++){
                if(k==x){
                    break;
                }
                sum += (a*difference);
            }
        System.out.println("Case #"+i+", Sum = "+sum);
    }
    }
}