C++ :

#include<bits/stdc++.h>
using namespace std;


int main() {
	int n,a[110],m,x,ma = 0;
	cin>>m>>x>>n;
	int i;
	for(i = 0; i < n; i++) {
		cin>>a[i];
		if(a[i] > a[ma]){
			ma = i;
		}
	}
	
	cout<<ma+1<<" "<<(a[ma]-x) * m;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
        int num2 = scanner.nextInt();
        int num3 = scanner.nextInt();
        int[] a = new int[num3];
        int x = 0,y = 0;
        int s = 0;
        for (int i = 0; i < num3; i++) {
            a[i] = scanner.nextInt();
        }
        for (int i = 0; i < num3; i++) {
            if(num2 < a[i]){
                x = a[i] - num2;
                if(y < x){
                    y = x;
                }
            }
        }for (int i = 0; i < num3; i++) {
            if(num2 < a[i]){
                if(y == a[i] - num2){
                    s = y * num1;
                    System.out.println((i + 1) + " " + s);
                    break;
                }

            }
        }
    }

    public static boolean judge(int i,int j){
        int a,s = 0;
        while(i != 0){
            a = i % 10;
            s = s + a;
            i /= 10;
        }
        if(s == j)return true;
        else return false;
    }

    public static void paiXu(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
}

Python :

sr=input().split()
m=int(sr[0])
x=int(sr[1])
n=int(sr[2])
a=input().split()
a=list(map(int,a))
da=max(a)
dai=a.index(da)+1
s=m*da-m*x
print(dai,s)