/*

Annie Abraham

Thomas Jefferson High School for Science and Technology

Junior Divison

Contest #3 2012-2013

AA_ChessQueen

*/

import java.util.*;

import java.text.*;

import java.io.*;

public class AA_ChessQueen

{

public static void main (String[] args)

{

Scanner sc;

String input;

String inp[];

int[][] array = new int[5][5];

int row;

int col;

int N;

try

{

sc = new Scanner(new File("Queen.in"));

System.setOut(new PrintStream(new FileOutputStream("Queen.out")));

}

catch(Exception e)

{

System.out.println("file not found");

return;

}

for(int m = 1; m <=5; m++)

{

input = sc.nextLine();

inp = input.split(",");

row = (Integer.parseInt(inp[0])) -1;

col =(Integer.parseInt(inp[1])) -1;

N = Integer.parseInt(inp[2]);

int count = 0;

int i;

int z;

int y;

for ( z =0; z< 5; z++)

{

for ( y = 0; y<5; y++)

{

array[z][y] = 0;

}

}

array[row][col] = 1;

//up

for(i = 1; i<=N;i++)

{

if ((col + i) < 5)

array[row][col + i] = 1;

}

//down

for ( i =1; i<=N; i++)

{

if ((col -i)>=0)

array[row][col-i] = 1;

}

//left

for( i =1; i<=N;i++)

{

if ((row -i)>=0)

array[row-i][col] = 1;

}

//right

for(i = 1; i<=N; i++)

{

if ((row + i) < 5)

array[row+i][col] = 1;

}

// down-right diagonal

for(i = 1; i<=N; i++)

{

if (((row -i)>=0 )&&((col +i) < 5 ))

array[row-i][col+i] = 1;

}

//up-right diagonal

for( i =1; i<=N; i++)

{

if (((row +i) < 5 )&&((col +i) < 5 ))

array[row+i][col+i] = 1;

}

//down-left diagonal

for(i = 1; i<=N; i++)

{

if (((row -i) >= 0)&&((col -i)>=0 ))

array[row-i][col-i] = 1;

}

// up left diagonal

for(i = 1; i<=N; i++)

{

if (((row +i) < 5) && ((col -i)>=0))

array[row+i][col-i] = 1;

}

//counts the "safe" spaces

for (z =0; z< 5; z++)

{

for (y = 0; y<5; y++)

{

if (array[z][y] == 0)

count++;

}

}

System.out.println(count);

}

}

}